Hyperadditive games and applications to networks or matching problems

DOI10.1016/J.JET.2020.105168MaRDI QIDQ1995312zbMATH OpenOpenAlexFDO

Authors Eric Bahel

Publication date 23 February 2021

Published in Journal of Economic Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jet.2020.105168

zbMATH Keywords

networkmatchingcoreTU gameobjectionhyperadditive

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43)

Recommendations

• scientific article; zbMATH DE number 4121796
• On Some Network Flow Games
• scientific article; zbMATH DE number 4064797
• Monotonicity of the core and value in dynamic cooperative games
• Cores of convex games

Cites work

• scientific article; zbMATH DE number 3006370 (Why is no real title available?)
• scientific article; zbMATH DE number 1768785 (Why is no real title available?)
• scientific article; zbMATH DE number 3214144 (Why is no real title available?)
• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• scientific article; zbMATH DE number 3078999 (Why is no real title available?)
• A cost sharing example in which subsidies are necessary for stability
• A fair rule in minimum cost spanning tree problems
• An average lexicographic value for cooperative games
• Bargaining Foundations of Shapely Value
• Bargaining with commitments
• Characterization of the extreme core allocations of the assignment game.
• Clan games
• Cores of convex games
• Cores of exact games. I
• Graphs and Cooperation in Games
• Information, Efficiency, and the Core of an Economy
• Job Matching, Coalition Formation, and Gross Substitutes
• Job matching with heterogeneous firms and workers
• Minimum cost arborescences
• Minimum incoming cost rules for arborescences
• Monotonic solutions of cooperative games
• On cost allocation for a spanning tree: A game theoretic approach
• On extreme points of the core and reduced games
• On the bargaining set, kernel and core of superadditive games
• On the core and bargaining set of a veto game
• On the set of extreme core allocations for minimal cost spanning tree problems
• One-to-many bargaining when pairwise agreements are non-renegotiable
• Shortest path games
• Stability and fairness in the job scheduling problem
• Stable lexicographic rules for shortest path games
• The assignment game. I: The core
• The average tree solution for cooperative games with communication structure
• The kernel and bargaining set for convex games
• The kernel of a cooperative game
• Weak differential marginality and the Shapley value
• Weakly monotonic solutions for cooperative games

Cited in

(3)

• Some new results on generalized additive games
• The reciprocity set
• Matching markets with middlemen under transferable utility

This page was built for publication: Hyperadditive games and applications to networks or matching problems

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