A proof that the core of an ordinal convex game is a von Neumann- Morgenstern solution

DOI10.1016/0165-4896(86)90006-5MaRDI QIDQ1069868zbMATH OpenOpenAlexFDO

Authors Bezalel Peleg

Publication date 1986

Published in Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0165-4896(86)90006-5

zbMATH Keywords

cooperative games without side paymentscoreordinal convex gamereduced gamesvon Neumann-Morgenstern solution

Mathematics Subject Classification ID

Cooperative games (91A12)

Review text

It is proved that the core of an ordinal convex game is a von Neumann- Morgenstern solution. The proof makes a strong use of reduced games of cooperative games without side payments.

Recommendations

• Cores of convex games
• scientific article; zbMATH DE number 4066671
• scientific article; zbMATH DE number 4077005
• A note on the core and von Neumann-Morgenstern solutions of simple games
• An axiomatization of the core of cooperative games without side payments

Cites work

• Convex games without side payments
• Cores of Convex Games Without Side Payments
• scientific article; zbMATH DE number 3898540 (Why is no real title available?)
• scientific article; zbMATH DE number 3566588 (Why is no real title available?)
• The kernel and bargaining set for convex games
• The Structure of the Kernel of a Cooperative Game

Cited in

(20)

• Stability of topological effectivity functions
• A consistent bargaining set
• A note on the core and von Neumann-Morgenstern solutions of simple games
• Core equivalence theorems for infinite convex games
• Von Neumann-Morgenstern stable sets of a patent licensing game: the existence proof
• On the sensitivity of von Neumann and Morgenstern abstract stable sets: The stable and the individual stable bargaining set
• Von Neumann-Morgenstern stable sets in matching problems
• Constrained core solutions for totally positive games with ordered players
• scientific article; zbMATH DE number 3850862 (Why is no real title available?)
• On Bargaining Sets of Convex NTU Games
• scientific article; zbMATH DE number 4066671 (Why is no real title available?)
• Strong convexity of NTU games
• STABILITY OF THE CORE IN A CLASS OF NTU GAMES: A CHARACTERIZATION
• Cooperative games (von Neumann-Morgenstern stable sets)
• Convex and exact games with non-transferable utility
• Cores and large cores when population varies
• An axiomatization of the weighted NTU value
• Comparative cooperative game theory
• Computing the cores of strategic games with punishment-dominance relations
• von Neumann-Morgenstern stable sets of income tax rates in public good economies

This page was built for publication: A proof that the core of an ordinal convex game is a von Neumann- Morgenstern solution

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