No-envy in queueing problems

DOI10.1007/S00199-005-0011-4MaRDI QIDQ2505518zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• No-envy in the queueing problem with multiple identical machines
• No-envy, solidarity, and strategy-proofness in the queueing problem
• Egalitarian equivalence and strategyproofness in the queueing problem
• Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
• Fair queueing

Cites work

• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• A characterization of the Shapley value in queueing problems
• A pessimistic approach to the queueing problem
• Achieving the first best in sequencing problems.
• Can everyone benefit from growth ? Two difficulties
• Fair Allocation of Indivisible Goods and Criteria of Justice
• Fair division under joint ownership: Recent results and open problems
• Identical preferences lower bound solution and consistency in economies with indivisible goods
• Large Indivisibles: An Analysis with Respect to Price Equilibrium and Fairness
• Mechanism design in queueing problems
• On monotonicity in economies with indivisible goods

Cited in

(34)

• Egalitarian equivalence and strategyproofness in the queueing problem
• A characterization of the symmetrically balanced VCG rule in the queueing problem
• No-envy and Arrow's conditions
• Auctioning and selling positions: a non-cooperative approach to queueing conflicts
• Balanced consistency and balanced cost reduction for sequencing problems
• The average tree permission value for games with a permission tree
• A fair staff allocation rule for the capacity pooling of multiple call centers
• Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency
• Subgroup additivity in the queueing problem
• No-envy, solidarity, and strategy-proofness in the queueing problem
• Consistency and monotonicity in sequencing problems
• Balanced VCG mechanisms for sequencing problems
• Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
• Children crying at birthday parties. Why?
• The on-line transfer rule for queueing with arrivals
• Generalized welfare lower bounds and strategyproofness in sequencing problems
• Fairness and implementability in allocation of indivisible objects with monetary compensations
• A comparison of formulations and solution methods for the minimum-envy location problem
• Characterizations of pivotal mechanisms in the queueing problem
• Egalitarianism in the queueing problem
• A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems
• No-envy and egalitarian-equivalence under multi-object-demand for heterogeneous objects
• Prior-free online mechanisms for queueing with arrivals
• Component efficient solutions in line-graph games with applications
• No-envy in the queueing problem with multiple identical machines
• Second-best mechanisms in queuing problems without transfers: the role of random priorities
• Incentives and justice for sequencing problems
• Comparable characterizations of four solutions for permission tree games
• Knapsack cost sharing
• Reordering an existing queue
• Recent developments in the queueing problem
• Consistent queueing rules
• Welfare lower bounds and strategy-proofness in the queueing problem
• Axiomatizations of two types of Shapley values for games on union closed systems

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

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