 Hyperadditive games and applications to networks or matching problemsEric Bahel Journal of Economic Theory, 2021, vol. 191, issue C Abstract: For the class of cooperative games with transferable utility, we introduce and study the notion of hyperadditivity, a new cohesiveness property weaker than convexity and stronger than superadditivity. It is first established that every hyperadditive game is balanced: we propose a formula allowing to compute some core allocations; and this leads to the definition of a single-valued solution that satisfies core selection for hyperadditive games. This new solution coincides with the Shapley value on the subclass of convex games. Furthermore, we prove that the bargaining set of a hyperadditive game is equal to its core. It is shown that many well-known economic applications satisfy hyperadditivity. Our work extends (and gives a unifying explanation for) various results found in the literature on network games, assignment games and convex games. In addition, some new results are derived for these respective families of games. Keywords: TU game; Hyperadditive; Core; Objection; Network; Matching (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:jetheo:v:191:y:2021:i:c:s0022053120301617 DOI: 10.1016/j.jet.2020.105168 Access Statistics for this article Journal of Economic Theory is currently edited by A. Lizzeri and K. Shell More articles in Journal of Economic Theory from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.