No-envy in queueing problems

DOI10.1007/s00199-005-0011-4zbMath1103.90325OpenAlexW2044503666MaRDI QIDQ2505518

Youngsub Chun

Publication date: 26 September 2006

Published in: Economic Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00199-005-0011-4

zbMATH Keywords

Egalitarian equivalenceCost monotonicityNo-envyIdentical preferences lower boundQueueing problem

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items (31)

No-envy and egalitarian-equivalence under multi-object-demand for heterogeneous objects ⋮ Subgroup additivity in the queueing problem ⋮ Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems ⋮ Component efficient solutions in line-graph games with applications ⋮ Incentives and justice for sequencing problems ⋮ Children crying at birthday parties. Why? ⋮ No-envy, solidarity, and strategy-proofness in the queueing problem ⋮ Second-best mechanisms in queuing problems without transfers: the role of random priorities ⋮ Egalitarianism in the queueing problem ⋮ Recent developments in the queueing problem ⋮ Auctioning and selling positions: a non-cooperative approach to queueing conflicts ⋮ Consistent queueing rules ⋮ Balanced VCG mechanisms for sequencing problems ⋮ 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 characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems ⋮ A fair staff allocation rule for the capacity pooling of multiple call centers ⋮ Characterizations of pivotal mechanisms in the queueing problem ⋮ Fairness and implementability in allocation of indivisible objects with monetary compensations ⋮ Egalitarian equivalence and strategyproofness in the queueing problem ⋮ Comparable characterizations of four solutions for permission tree games ⋮ Welfare lower bounds and strategy-proofness in the queueing problem ⋮ Knapsack cost sharing ⋮ Consistency and monotonicity in sequencing problems ⋮ Axiomatizations of two types of Shapley values for games on union closed systems ⋮ The average tree permission value for games with a permission tree ⋮ A characterization of the symmetrically balanced VCG rule in the queueing problem ⋮ A comparison of formulations and solution methods for the minimum-envy location problem ⋮ Prior-free online mechanisms for queueing with arrivals ⋮ No-envy in the Queueing Problem with Multiple Identical Machines

Cites Work

• Unnamed Item
• Fair division under joint ownership: Recent results and open problems
• Can everyone benefit from growth ? Two difficulties
• A characterization of the Shapley value in queueing problems
• Achieving the first best in sequencing problems.
• Identical preferences lower bound solution and consistency in economies with indivisible goods
• A pessimistic approach to the queueing problem
• On monotonicity in economies with indivisible goods
• Large Indivisibles: An Analysis with Respect to Price Equilibrium and Fairness
• Fair Allocation of Indivisible Goods and Criteria of Justice
• Mechanism design in queueing problems

This page was built for publication: No-envy in queueing problems