Pages that link to "Item:Q2806824"
From MaRDI portal
The following pages link to Zero-sum polymatrix games: a generalization of minmax (Q2806824):
Displaying 19 items.
- Polymatrix games and optimization problems (Q463366) (← links)
- A generalization of a classical zero-sum problem (Q879346) (← links)
- A note on polymatrix games (Q1823172) (← links)
- Zero-sum polymatrix games with link uncertainty: a Dempster-Shafer theory solution (Q2007652) (← links)
- Identifying behaviorally robust strategies for normal form games under varying forms of uncertainty (Q2028782) (← links)
- The complexity of the parity argument with potential (Q2037189) (← links)
- Strategic decompositions of normal form games: zero-sum games and potential games (Q2195713) (← links)
- Fictitious play in networks (Q2206807) (← links)
- The duality gap for two-team zero-sum games (Q2416652) (← links)
- Exploration-exploitation in multi-agent learning: catastrophe theory meets game theory (Q2667841) (← links)
- On the Shapley value of liability games (Q2670595) (← links)
- Strict equilibria interchangeability in multi-player zero-sum games (Q2937695) (← links)
- Minimax representation of nonexpansive functions and application to zero-sum recursive games (Q4609985) (← links)
- The Polymatrix Gap Conjecture (Q5038398) (← links)
- Automated equilibrium analysis of \(2\times 2\times 2\) games (Q6109520) (← links)
- Fast convergence of optimistic gradient ascent in network zero-sum extensive form games (Q6164523) (← links)
- Separable Network Games with Compact Strategy Sets (Q6488586) (← links)
- A logical description of priority separable games (Q6562527) (← links)
- Semidefinite games (Q6665440) (← links)
