Reordering an existing queue
From MaRDI portal
Publication:1704061
DOI10.1007/s00355-017-1051-yzbMath1394.90194OpenAlexW175476947WikidataQ59605078 ScholiaQ59605078MaRDI QIDQ1704061
Suresh Mutuswami, Manipushpak Mitra, Youngsub Chun
Publication date: 8 March 2018
Published in: Social Choice and Welfare (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00355-017-1051-y
Queues and service in operations research (90B22) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items (2)
Recent developments in the queueing problem ⋮ Prior-free online mechanisms for queueing with arrivals
Cites Work
- Characterizations of pivotal mechanisms in the queueing problem
- When queueing is better than push and shove
- Group strategyproofness in queueing models
- Incentive compatibility in a market with indivisible goods
- Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
- Robust trading mechanisms
- Sequencing games
- A characterization of the Shapley value in queueing problems
- On cores and indivisibility
- Egalitarian equivalence and strategyproofness in the queueing problem
- A characterization of the symmetrically balanced VCG rule in the queueing problem
- Incentives in landing slot problems
- No-envy in queueing problems
- A pessimistic approach to the queueing problem
- Dissolving a Partnership Efficiently
- Incentives in Teams
- Groves' Scheme on Restricted Domains
- Strategy proofness and Pareto efficiency in quasilinear exchange economies
- Strategy-Proof Exchange
- College Admissions and the Stability of Marriage
- Mechanism design in queueing problems
This page was built for publication: Reordering an existing queue
