Subgroup additivity in the queueing problem
From MaRDI portal
Publication:296745
DOI10.1016/J.EJOR.2014.03.038zbMATH Open1338.90124OpenAlexW2040491937MaRDI QIDQ296745FDOQ296745
Authors: Youngsub Chun, Manipushpak Mitra 
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
Recommendations
- Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
- A characterization of the symmetrically balanced VCG rule in the queueing problem
- No-envy, solidarity, and strategy-proofness in the queueing problem
- A characterization of the Shapley value in queueing problems
- A pessimistic approach to the queueing problem
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cites Work
- A Class of Decomposable Poverty Measures
- Title not available (Why is that?)
- Sequencing games
- On the convexity of precedence sequencing games
- On the reduced game property and its converse
- A characterization of the Shapley value in queueing problems
- Incentives in Teams
- Achieving the first best in sequencing problems.
- Family sequencing and cooperation
- No-envy in queueing problems
- A pessimistic approach to the queueing problem
- Minimizing the Worst Slowdown: Offline, Online
- Scheduling with Opting Out: Improving upon Random Priority
- Consistency and monotonicity in sequencing problems
- Group strategyproofness in queueing models
- Mechanism design in queueing problems
- On the convexity of games corresponding to sequencing situations with due dates.
- Sequencing games with controllable processing times
- Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
Cited In (1)
This page was built for publication: Subgroup additivity in the queueing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296745)
