The Proof That a Game May Not Have a Solution

DOI10.2307/1994798MaRDI QIDQ5576145zbMATH OpenOpenAlexWikidataFDO

Authors William F. Lucas

Publication date 1969

Full work available at URL https://doi.org/10.2307/1994798

zbMATH Keywords

operations research

Cites work

• A game with no solution
• scientific article; zbMATH DE number 3139280 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)

Cited in

(14)

• An absorbing set for cooperative games
• On coalition formation: A game-theoretical approach
• Von Neumann-Morgenstern stable sets of a patent licensing game: the existence proof
• Core theory for multiple-sided assignment games
• Bezalel Peleg: a bibliography
• Von Neumann-Morgenstern stable set rationalization of choice functions
• The coming of game theory
• Absorbing set forn-person games
• Finite Solution Theory for Coalitional Games
• Disconnected solutions
• The stable set of the social conflict game with commitments: existence, uniqueness, and efficiency
• Minimal balanced collections and their application to core stability and other topics of game theory
• Cooperative TU-games: dominance, stable sets, and the core revisited
• A dynamic solution concept for abstract games

This page was built for publication: The Proof That a Game May Not Have a Solution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5576145)