Hyperadditive games and applications to networks or matching problems

DOI10.1016/J.JET.2020.105168zbMATH Open1458.91021OpenAlexW3109593158MaRDI QIDQ1995312FDOQ1995312

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)

Cites Work

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

Cited In (2)

• 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)