Multi-sided assignment games on \(m\)-partite graphs

DOI10.1007/s10479-019-03256-5zbMath1430.91013OpenAlexW2585278761WikidataQ127843671 ScholiaQ127843671MaRDI QIDQ2288857

Marina Núñez, Ata Atay

Publication date: 20 January 2020

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-019-03256-5

zbMATH Keywords

cooperative gamescoremulti-sided assignment games

Mathematics Subject Classification ID

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

Related Items (3)

Assortative multisided assignment games: the extreme core points ⋮ Review of the theory of stable matchings and contract systems ⋮ Matching markets with middlemen under transferable utility

Cites Work

• Generalized three-sided assignment markets: core consistency and competitive prices
• Cores of partitioning games
• Strongly balanced cooperative games
• The core of an \(m\)-sided assignment game
• The supplier-firm-buyer game and its \(m\)-sided generalization
• An algorithm for finding the nucleolus of assignment games
• The assignment game: the \(\tau\)-value
• Core theory for multiple-sided assignment games
• Games induced by the partitioning of a graph
• Tree, web and average web values for cycle-free directed graph games
• A procedure to compute the nucleolus of the assignment game
• Core stability in chain-component additive games
• The assignment game. I: The core
• Assignment Problems
• Conflict and Coincidence of Interest in Job Matching: Some New Results and Open Questions
• On Some Network Flow Games
• Graphs and Cooperation in Games
• Algorithmic Aspects of the Core of Combinatorial Optimization Games
• The Nucleolus of a Characteristic Function Game
• The core of games on ordered structures and graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Multi-sided assignment games on \(m\)-partite graphs