Pages that link to "Item:Q5576145"
From MaRDI portal
The following pages link to The Proof That a Game May Not Have a Solution (Q5576145):
Displaying 14 items.
- The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
- The stable set of the social conflict game with commitments: existence, uniqueness, and efficiency (Q521883) (← links)
- A dynamic solution concept for abstract games (Q754782) (← links)
- An absorbing set for cooperative games (Q1102880) (← links)
- On coalition formation: A game-theoretical approach (Q1131966) (← links)
- Von Neumann-Morgenstern stable sets of a patent licensing game: the existence proof (Q1645200) (← links)
- Core theory for multiple-sided assignment games (Q1913575) (← links)
- Bezalel Peleg: a bibliography (Q1938823) (← links)
- Von Neumann-Morgenstern stable set rationalization of choice functions (Q2202240) (← links)
- The coming of game theory (Q2487764) (← links)
- Absorbing set forn-person games (Q3758590) (← links)
- Finite Solution Theory for Coalitional Games (Q3958303) (← links)
- Disconnected solutions (Q4108162) (← links)
- Minimal balanced collections and their application to core stability and other topics of game theory (Q6069152) (← links)
