No-envy in the queueing problem with multiple identical machines

DOI10.1007/978-981-16-4737-6_9MaRDI QIDQ5022157zbMATH OpenOpenAlexFDO

Authors Manipushpak Mitra, Suresh Mutuswami

Publication date 18 January 2022

Published in Indian Statistical Institute Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-981-16-4737-6_9

zbMATH Keywords

no-envybudget balancePareto efficiencyequal treatment of equalsoutcome efficiencyLorenz optimalitymultiple identical machine queueing problems

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Recommendations

• No-envy in queueing problems
• Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
• No-envy, solidarity, and strategy-proofness in the queueing problem
• Egalitarian equivalence and strategyproofness in the queueing problem
• Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency

Cites work

• A characterization of egalitarian equivalence
• A characterization of the Shapley value in queueing problems
• A characterization of the symmetrically balanced VCG rule in the queueing problem
• A pessimistic approach to the queueing problem
• Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
• Egalitarian equivalence and strategyproofness in the queueing problem
• Egalitarian-equivalent Groves mechanisms in the allocation of heterogeneous objects
• Egalitarianism in the queueing problem
• Fair Allocation of Indivisible Goods and Criteria of Justice
• Fair division under joint ownership: Recent results and open problems
• Fair queueing
• How to Cut A Cake Fairly
• Identical preferences lower bound solution and consistency in economies with indivisible goods
• Implementing Efficient Egalitarian Equivalent Allocations
• Implementing egalitarian-equivalent allocation of indivisible goods on restricted domains
• Incomplete information and multiple machine queueing problems
• Large Indivisibles: An Analysis with Respect to Price Equilibrium and Fairness
• Lorenz rankings of rules for the adjudication of conflicting claims
• No-Envy and Consistency in Economies with Indivisible Goods
• No-envy in queueing problems
• On the nonexistence of envy-free and egalitarian-equivalent allocations in economies with indivisibilities
• Recent developments in the queueing problem
• Welfare bounds in the fair division problem
• Welfare lower bounds and strategy-proofness in the queueing problem

Cited in

(5)

• No-envy, solidarity, and strategy-proofness in the queueing problem
• Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
• Weak group strategy-proof and queue-efficient mechanisms for the queueing problem with multiple machines
• Queueing games with an endogenous number of machines
• No-envy in queueing problems

This page was built for publication: No-envy in the queueing problem with multiple identical machines

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