The following pages link to (Q5808751):
Displaying 21 items.
- On the rate of convergence of fictitious play (Q372994) (← links)
- On vector matrix game and symmetric dual vector optimization problem (Q383875) (← links)
- On Stackelberg mixed strategies (Q516242) (← links)
- Computing the minimal covering set (Q943589) (← links)
- A note on the L-P formulation of zero-sum sequential games with incomplete information (Q1218348) (← links)
- Simulating cardinal preferences in Boolean games: a proof technique (Q1641024) (← links)
- Distributionally robust chance-constrained games: existence and characterization of Nash equilibrium (Q1676488) (← links)
- A second-order cone programming formulation for two player zero-sum games with chance constraints (Q1719615) (← links)
- Variational inequality formulation for the games with random payoffs (Q1756801) (← links)
- Symmetric duality in quadratic programming and matrix game equivalence. (Q1767217) (← links)
- Symmetric dual nonlinear programming and matrix game equivalence (Q1888210) (← links)
- Formulating generalised `goal games' against nature: An illustration from decision-making under uncertainty in agriculture (Q2369177) (← links)
- Playing games with bounded entropy (Q2416656) (← links)
- Robust optimal experiment design for system identification (Q2475459) (← links)
- Majoritarian Blotto contests with asymmetric battlefields: an experiment on apex games (Q2634135) (← links)
- Constant Rank Two-Player Games are PPAD-hard (Q4554071) (← links)
- Semidefinite Programming and Nash Equilibria in Bimatrix Games (Q4995090) (← links)
- A dynamical neural network approach for solving stochastic two-player zero-sum games (Q6077009) (← links)
- A canonical game -- 75 years in the making -- showing the equivalence of matrix games and linear programming (Q6088188) (← links)
- A stochastic variant of replicator dynamics in zero-sum games and its invariant measures (Q6090682) (← links)
- (Q6191851) (← links)
