Second-best mechanisms in queuing problems without transfers: the role of random priorities

DOI10.1016/J.MATHSOCSCI.2017.08.006MaRDI QIDQ1680100zbMATH OpenOpenAlexFDO

Authors Francis Bloch

Publication date 22 November 2017

Published in Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.mathsocsci.2017.08.006

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Recommendations

• Mechanism design in queueing problems
• Incomplete information and multiple machine queueing problems
• Cardinal Bayesian allocation mechanisms without transfers
• Reordering an existing queue
• scientific article; zbMATH DE number 4035516

Cites work

• A characterization of the Shapley value in queueing problems
• Achieving the first best in sequencing problems.
• Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
• Egalitarian equivalence and strategyproofness in the queueing problem
• Mechanism design in queueing problems
• No-envy in queueing problems
• On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs
• Proportional scheduling, split-proofness, and merge-proofness
• Scheduling with Opting Out: Improving upon Random Priority
• Simple sequencing problems with interdependent costs

Cited in

(1)

• Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms

This page was built for publication: Second-best mechanisms in queuing problems without transfers: the role of random priorities

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