Assignment games with population monotonic allocation schemes

DOI10.1007/S00355-023-01477-ZzbMATH Open1539.91005MaRDI QIDQ6541010FDOQ6541010

Authors: Tamás Solymosi 

Publication date: 17 May 2024

Published in: Social Choice and Welfare (Search for Journal in Brave)

Mathematics Subject Classification ID

Cooperative games (91A12) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites Work

• The Nucleolus of a Characteristic Function Game
• An algorithm for finding the nucleolus of assignment games
• The assignment game. I: The core
• On the Nucleolus of a Characteristic Function Game
• Population monotonic allocation schemes for cooperative games with transferable utility
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimum cost spanning tree games and population monotonic allocation schemes.
• Assignment games with stable core
• Title not available (Why is that?)
• The assignment game: the \(\tau\)-value
• Population monotonic path schemes for simple games
• The maximum and the addition of assignment games
• Population monotonic allocation schemes in bankruptcy games
• A dual description of the class of games with a population monotonic allocation scheme
• Title not available (Why is that?)
• Population monotonicity in matching games
• On the population monotonicity of independent set games
• Monotonic core allocation paths for assignment games
• Population monotonic allocation schemes for vertex cover games
• A note on weighted multi-glove games

This page was built for publication: Assignment games with population monotonic allocation schemes

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