Assignment games satisfy the CoMa-property

DOI10.1006/game.2001.0882zbMath1018.91006OpenAlexW2065762666MaRDI QIDQ700114

S. H. Tijs, Herbert Hamers, Flip Klijn, Joan Pere Villar, Tamás Solymosi

Publication date: 30 September 2002

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/d239a1e2245e38f8011466bc76afbf96d6d555f6

zbMATH Keywords

coreTU gamesCoMa-property

Mathematics Subject Classification ID

Cooperative games (91A12)

Related Items (17)

A simple procedure to obtain the extreme core allocations of an assignment market ⋮ From the bankruptcy problem and its concede-and-divide solution to the assignment problem and its fair division solution ⋮ On the set of extreme core allocations for minimal cost spanning tree problems ⋮ Lexicographic allocations and extreme core payoffs: the case of assignment games ⋮ Assortative multisided assignment games: the extreme core points ⋮ Characterization of the extreme core allocations of the assignment game. ⋮ Analysis of the core of multisided Böhm-Bawerk assignment markets ⋮ A survey on assignment markets ⋮ Assignment markets with the same core ⋮ Solving Becker's assortative assignments and extensions ⋮ Does it make sense to analyse a two-sided market as a multi-choice game? ⋮ Enforcing fair cooperation in production-inventory settings with heterogeneous agents ⋮ Core of the assignment game via fixed point methods ⋮ Monotonic core allocation paths for assignment games ⋮ ASSIGNMENT SITUATIONS WITH MULTIPLE OWNERSHIP AND THEIR GAMES ⋮ The boundary of the core of a balanced game: face games ⋮ On the nucleolus of neighbor games

Cites Work

• Unnamed Item
• Unnamed Item
• Super-modularity: Applications to convex games and to the greedy algorithm for LP
• On the core of information graph games
• Cores of convex games
• The assignment game. I: The core
• Minimum cost spanning tree games

This page was built for publication: Assignment games satisfy the CoMa-property