No-envy in the queueing problem with multiple identical machines
From MaRDI portal
Publication:5022157
DOI10.1007/978-981-16-4737-6_9zbMATH Open1481.90132OpenAlexW4205658941MaRDI QIDQ5022157FDOQ5022157
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
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
no-envybudget balancePareto efficiencyequal treatment of equalsoutcome efficiencyLorenz optimalitymultiple identical machine queueing problems
Cites Work
- Large Indivisibles: An Analysis with Respect to Price Equilibrium and Fairness
- A characterization of the Shapley value in queueing problems
- No-Envy and Consistency in Economies with Indivisible Goods
- Egalitarian-equivalent Groves mechanisms in the allocation of heterogeneous objects
- No-envy in queueing problems
- A pessimistic approach to the queueing problem
- Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
- Fair queueing
- Fair Allocation of Indivisible Goods and Criteria of Justice
- Implementing Efficient Egalitarian Equivalent Allocations
- How to Cut A Cake Fairly
- Welfare bounds in the fair division problem
- Fair division under joint ownership: Recent results and open problems
- Incomplete information and multiple machine queueing problems
- Lorenz rankings of rules for the adjudication of conflicting claims
- Egalitarian equivalence and strategyproofness in the queueing problem
- Implementing egalitarian-equivalent allocation of indivisible goods on restricted domains
- Welfare lower bounds and strategy-proofness in the queueing problem
- Identical preferences lower bound solution and consistency in economies with indivisible goods
- A characterization of egalitarian equivalence
- On the nonexistence of envy-free and egalitarian-equivalent allocations in economies with indivisibilities
- A characterization of the symmetrically balanced VCG rule in the queueing problem
- Egalitarianism in the queueing problem
- Recent developments 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)
