A pessimistic approach to the queueing problem

DOI10.1016/j.mathsocsci.2005.08.002zbMath1162.91311OpenAlexW2037303623MaRDI QIDQ2507236

Youngsub Chun

Publication date: 10 October 2006

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2005.08.002

zbMATH Keywords

Shapley valueaxiomatic characterizationsmaximal transfer ruleminimal transfer rulequeueing problems

Mathematics Subject Classification ID

Cooperative games (91A12) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Social choice (91B14)

Related Items (30)

Subgroup additivity in the queueing problem ⋮ Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems ⋮ The proportional Shapley value and applications ⋮ No-envy, solidarity, and strategy-proofness in the queueing problem ⋮ Egalitarianism in the queueing problem ⋮ Recent developments in the queueing problem ⋮ Auctioning and selling positions: a non-cooperative approach to queueing conflicts ⋮ Balanced externalities and the proportional allocation of nonseparable contributions ⋮ Weak group strategy-proof and queue-efficient mechanisms for the queueing problem with multiple machines ⋮ Balanced VCG mechanisms for sequencing problems ⋮ Characterizing the Shapley value in fixed-route traveling salesman problems with appointments ⋮ Balanced consistency and balanced cost reduction for sequencing problems ⋮ Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency ⋮ Reordering an existing queue ⋮ A fair staff allocation rule for the capacity pooling of multiple call centers ⋮ Characterizations of pivotal mechanisms in the queueing problem ⋮ Proportional scheduling, split-proofness, and merge-proofness ⋮ Understanding the coincidence of allocation rules: symmetry and orthogonality in TU-games ⋮ Fairness and implementability in allocation of indivisible objects with monetary compensations ⋮ The optimistic \(TU\) game in minimum cost spanning tree problems ⋮ Egalitarian equivalence and strategyproofness in the queueing problem ⋮ Welfare lower bounds and strategy-proofness in the queueing problem ⋮ Switching queues, cultural conventions, and social welfare ⋮ Consistency and monotonicity in sequencing problems ⋮ The truncated core for games with upper bounds ⋮ A characterization of the symmetrically balanced VCG rule in the queueing problem ⋮ No-envy in queueing problems ⋮ On the coincidence of the prenucleolus and the Shapley value ⋮ No-envy in the Queueing Problem with Multiple Identical Machines ⋮ Comments on: ``Recent developments in the queueing problem

Cites Work

• Unnamed Item
• Unnamed Item
• Problems of fair division and the egalitarian solution
• Fair division under joint ownership: Recent results and open problems
• Game theoretic analysis of a bankruptcy problem from the Talmud
• Monotonicity properties of bargaining solutions when applied to economics
• Can everyone benefit from growth ? Two difficulties
• Sequencing games
• A characterization of the Shapley value in queueing problems
• Achieving the first best in sequencing problems.
• Welfare-domination under preference-replacement: a survey and open questions
• The Fair Division of a Fixed Supply Among a Growing Population
• Equality of Resources Implies Equality of Welfare
• The Pure Compensation Problem: Egalitarianism Versus Laissez-Fairism
• Mechanism design in queueing problems

This page was built for publication: A pessimistic approach to the queueing problem