Fair queueing

DOI10.1007/978-3-319-33771-5MaRDI QIDQ302274zbMATH OpenOpenAlexFDO

Authors Youngsub Chun

Publication date 5 July 2016

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

Full work available at URL https://doi.org/10.1007/978-3-319-33771-5

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Queues and service in operations research (90B22) Noncooperative games (91A10) Applications of game theory (91A80)

Recommendations

• Recent developments in the queueing problem
• Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
• Fair Queuing and Other Probabilistic Allocation Methods
• A pessimistic approach to the queueing problem
• No-envy, solidarity, and strategy-proofness in the queueing problem

Cited in

(26)

• Decentralized task coordination
• No-envy, solidarity, and strategy-proofness in the queueing problem
• Stability and fairness in the job scheduling problem
• Egalitarianism in the queueing problem
• Recent developments in the queueing problem
• No-envy in queueing problems
• A pessimistic approach to the queueing problem
• QUANTIFYING FAIRNESS IN QUEUING SYSTEMS
• Auctioning and selling positions: a non-cooperative approach to queueing conflicts
• On measuring fairness in queues
• No-envy in the queueing problem with multiple identical machines
• Fair Queuing and Other Probabilistic Allocation Methods
• A characterization of the Vickrey rule in slot allocation problems
• Consistent queueing rules
• Fairly taking turns
• Balanced VCG mechanisms for sequencing problems
• Optimal queue to minimize waste
• Queueing games with an endogenous number of machines
• The on-line transfer rule for queueing with arrivals
• The Shapley value in positional queueing problems
• Optimistic and pessimistic approaches for cooperative games
• Axiomatic and strategic foundations for the pairwise equal splitting rule in sequencing problems with an initial queue
• Cost-symmetric transfer rules for queueing with arrivals
• Axiomatic and strategic justifications of the connected equal splitting rule in the reordering problem
• Agent-wise-replication invariance, the Walrasian solution and the uniform rule
• The consistency principle in the reordering problem

This page was built for publication: Fair queueing

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