A cooperative approach to queue allocation of indivisible objects

DOI10.1142/S0219198909002273MaRDI QIDQ3402030zbMATH OpenFDO

Authors Herbert Hamers, Flip Klijn, Marco Slikker, Bas van Velzen

Publication date 2 February 2010

Published in International Game Theory Review (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0219198909002273

zbMATH Keywords

cooperative game theoryindivisible objectsqueue

Mathematics Subject Classification ID

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

Recommendations

• Queue allocation of indivisible goods
• Cooperation in Markovian queueing models
• Cooperative models for allocating an object
• Coalitional strategy-proofness and fairness
• Equitable distribution of indivisible objects

Cites work

• Fairness, the veil of ignorance and social choice
• On cores and indivisibility
• On one-sided versus two-sided matching games
• On some axioms for ranking sets of alternatives
• Permutation games: Another class of totally balanced games
• The assignment game. I: The core

Cited in

(1)

• Queue allocation of indivisible goods

This page was built for publication: A cooperative approach to queue allocation of indivisible objects

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