FIELD NOTES TOPIC

quadratically constrained programs

1 note, newest first.

  1. Variable Bound Tightening for Nash Equilibrium Computation in Multiplayer Imperfect-Information Games

    Source note ·

    A new method is presented for solving exact Nash equilibria in multiplayer imperfect-information games, which improves upon previous algorithms by using finite bounds on slack and multiplier variables in the nonlinear…