Egalitarianism in the queueing problem

DOI10.1016/J.JMATECO.2018.12.005MaRDI QIDQ2419503zbMATH OpenOpenAlexWikidataFDO

Authors Youngsub Chun, Manipushpak Mitra, Suresh Mutuswami

Publication date 13 June 2019

Published in Journal of Mathematical Economics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jmateco.2018.12.005

zbMATH Keywords

Egalitarian ruleslexicographically maximin optimallexicographically minimax optimalLorenz optimalqueueing

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Recommendations

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

Cites work

• A characterization of egalitarian equivalence
• A characterization of the Shapley value in queueing problems
• A Concept of Egalitarianism Under Participation Constraints
• A pessimistic approach to the queueing problem
• Balanced implementability of sequencing rules
• Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
• Egalitarian equivalence and strategyproofness in the queueing problem
• Equity and the Informational Basis of Collective Choice
• Equity, Arrow's Conditions, and Rawls' Difference Principle
• Fair Allocation of Indivisible Goods and Criteria of Justice
• Fair division under joint ownership: Recent results and open problems
• Fair queueing
• Group strategyproofness in queueing models
• Groves' Scheme on Restricted Domains
• Handbook of social choice and welfare. Vol. 1.
• scientific article; zbMATH DE number 3361657 (Why is no real title available?)
• Identical preferences lower bound solution and consistency in economies with indivisible goods
• Implementing Efficient Egalitarian Equivalent Allocations
• Large Indivisibles: An Analysis with Respect to Price Equilibrium and Fairness
• Lorenz rankings of rules for the adjudication of conflicting claims
• Maximin, leximin, and the protective criterion: Characterizations and comparisons
• Mechanism design in queueing problems
• 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
• Pitfalls in the theory of fairness
• Welfare bounds in the fair division problem
• Welfare lower bounds and strategy-proofness in the queueing problem

Cited in

(7)

• Lorenz optimality for sequencing problems with welfare bounds
• QUANTIFYING FAIRNESS IN QUEUING SYSTEMS
• On measuring fairness in queues
• No-envy in the queueing problem with multiple identical machines
• Balanced VCG mechanisms for sequencing problems
• Generalized welfare lower bounds and strategyproofness in sequencing problems
• Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems

This page was built for publication: Egalitarianism in the queueing problem

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