Convex games without side payments
From MaRDI portal
Publication:1152859
DOI10.1007/BF01769263zbMath0461.90088OpenAlexW2089603165MaRDI QIDQ1152859
Publication date: 1981
Published in: International Journal of Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01769263
coreconvex gameno side paymentstotally balanced gamecoincidence of solution setsNeumann-Morgenstern solution
Related Items
STABILITY OF THE CORE IN A CLASS OF NTU GAMES: A CHARACTERIZATION ⋮ How to divide a cake when people have different metabolism? ⋮ On Bargaining Sets of Convex NTU Games ⋮ A cardinal convex game with empty core ⋮ Global optimization of the difference of two increasing plus-convex-along-rays functions ⋮ Monotonicity of the core and value in dynamic cooperative games ⋮ A consistent bargaining set ⋮ Weighted values and the core in NTU games ⋮ Convex and exact games with non-transferable utility ⋮ Supermodular NTU-games ⋮ Strong convexity of NTU games ⋮ CONVEXITY IN STOCHASTIC COOPERATIVE SITUATIONS ⋮ The MC-value for monotonic NTU-games ⋮ A NON-COOPERATIVE BARGAINING PROCEDURE GENERALISING THE KALAI-SMORODINSKY BARGAINING SOLUTION TO NTU GAMES ⋮ Game theoretic modeling of increasing returns to scale ⋮ Monotonic analysis over ordered topological vector spaces: I ⋮ On the convexity of games corresponding to sequencing situations with due dates. ⋮ Nontransferable utility bankruptcy games ⋮ Global optimization of the difference of affine increasing and positively homogeneous functions ⋮ Stochastic cooperative games: Superadditivity, convexity, and certainty equivalents ⋮ A necessary and sufficient condition for the convexity in oligopoly games ⋮ The Shapley transfer value without zero weights ⋮ An axiomatization of the weighted NTU value ⋮ A proof that the core of an ordinal convex game is a von Neumann- Morgenstern solution ⋮ NTU PERT games
Cites Work
