Pages that link to "Item:Q868531"
From MaRDI portal
The following pages link to Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games (Q868531):
Displaying 14 items.
- Incompetence and impact of training in bimatrix games (Q360982) (← links)
- On perfect Nash equilibria of polymatrix games (Q457873) (← links)
- Polymatrix games and optimization problems (Q463366) (← links)
- On the performance of managers and controllers: a polymatrix game approach for the manager-controller-board of directors' conflict (Q725890) (← links)
- Enumeration of Nash equilibria for two-player games (Q847809) (← links)
- An exact solution method for binary equilibrium problems with compensation and the power market uplift problem (Q1754126) (← links)
- On proper refinement of Nash equilibria for bimatrix games (Q1941251) (← links)
- Zero-sum polymatrix games with link uncertainty: a Dempster-Shafer theory solution (Q2007652) (← links)
- Hybrid global search algorithm with genetic blocks for solving hexamatrix games (Q2097315) (← links)
- A note on bimatrix game maximal Selten subsets (Q2254918) (← links)
- A NEW SEQUENCE FORM APPROACH FOR THE ENUMERATION AND REFINEMENT OF ALL EXTREME NASH EQUILIBRIA FOR EXTENSIVE FORM GAMES (Q3560092) (← links)
- (Q3585644) (← links)
- The Polymatrix Gap Conjecture (Q5038398) (← links)
- On computational search for Nash equilibrium in hexamatrix games (Q5963237) (← links)
