Subgroup additivity in the queueing problem

DOI10.1016/j.ejor.2014.03.038zbMath1338.90124OpenAlexW2040491937MaRDI QIDQ296745

Manipushpak Mitra, Youngsub Chun

Publication date: 23 June 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.03.038

zbMATH Keywords

egalitarian equivalencequeueing problemsubgroup additivityweak strategyproofness

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Cites Work

• Unnamed Item
• Consistency and monotonicity in sequencing problems
• Group strategyproofness in queueing models
• On the convexity of precedence sequencing games
• Sequencing games with controllable processing times
• Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
• On the reduced game property and its converse
• Sequencing games
• A characterization of the Shapley value in queueing problems
• Achieving the first best in sequencing problems.
• Family sequencing and cooperation
• No-envy in queueing problems
• A pessimistic approach to the queueing problem
• A Class of Decomposable Poverty Measures
• Minimizing the Worst Slowdown: Offline, Online
• Scheduling with Opting Out: Improving upon Random Priority
• Incentives in Teams
• Mechanism design in queueing problems
• On the convexity of games corresponding to sequencing situations with due dates.

This page was built for publication: Subgroup additivity in the queueing problem