Reordering an existing queue

DOI10.1007/S00355-017-1051-YMaRDI QIDQ1704061zbMATH OpenOpenAlexWikidataFDO

Authors Youngsub Chun, Manipushpak Mitra, Suresh Mutuswami

Publication date 8 March 2018

Published in Social Choice and Welfare (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00355-017-1051-y

zbMATH Keywords

budget balancingoutcome efficiencyqueue reordringstrategy proofness

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• scientific article; zbMATH DE number 3858810
• Order restoration in queues
• scientific article; zbMATH DE number 3858812
• Parallel queues with resequencing
• Ordered priority queues
• Order independent queues
• The Best Order for Queues in Series
• Scheduling arrivals to a queue
• Queue-mergesort

Cites work

• 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
• Characterizations of pivotal mechanisms in the queueing problem
• College Admissions and the Stability of Marriage
• Dissolving a Partnership Efficiently
• Egalitarian equivalence and strategyproofness in the queueing problem
• Group strategyproofness in queueing models
• Groves' Scheme on Restricted Domains
• Incentive compatibility in a market with indivisible goods
• Incentives in landing slot problems
• Incentives in Teams
• Mechanism design in queueing problems
• No-envy in queueing problems
• On cores and indivisibility
• Robust trading mechanisms
• Sequencing games
• Strategy proofness and Pareto efficiency in quasilinear exchange economies
• Strategy-Proof Exchange
• When queueing is better than push and shove

Cited in

(10)

• Second-best mechanisms in queuing problems without transfers: the role of random priorities
• Prior-free online mechanisms for queueing with arrivals
• Recent developments in the queueing problem
• scientific article; zbMATH DE number 3858810 (Why is no real title available?)
• When queueing is better than push and shove
• Mechanism design in queueing problems
• Generalized welfare lower bounds and strategyproofness in sequencing problems
• Axiomatic and strategic foundations for the pairwise equal splitting rule in sequencing problems with an initial queue
• Axiomatic and strategic justifications of the connected equal splitting rule in the reordering problem
• The consistency principle in the reordering problem

This page was built for publication: Reordering an existing queue

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