The Proof That a Game May Not Have a Solution
From MaRDI portal
Publication:5576145
DOI10.2307/1994798zbMath0184.23602OpenAlexW4250003075WikidataQ56387532 ScholiaQ56387532MaRDI QIDQ5576145
Publication date: 1969
Full work available at URL: https://doi.org/10.2307/1994798
Related Items
Von Neumann-Morgenstern stable sets of a patent licensing game: the existence proof, An absorbing set for cooperative games, Core theory for multiple-sided assignment games, The complexity of computing minimal unidirectional covering sets, Absorbing set forn-person games, On coalition formation: A game-theoretical approach, Minimal balanced collections and their application to core stability and other topics of game theory, Bezalel Peleg: a bibliography, Von Neumann-Morgenstern stable set rationalization of choice functions, Disconnected solutions, The stable set of the social conflict game with commitments: existence, uniqueness, and efficiency, The coming of game theory, A dynamic solution concept for abstract games, Finite Solution Theory for Coalitional Games
Cites Work
