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
Cites work
- scientific article; zbMATH DE number 3078997 (Why is no real title available?)
- A Class of Decomposable Poverty Measures
- A characterization of the Shapley value in queueing problems
- A pessimistic approach to the queueing problem
- Achieving the first best in sequencing problems.
- Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
- Consistency and monotonicity in sequencing problems
- Family sequencing and cooperation
- Group strategyproofness in queueing models
- Incentives in Teams
- Mechanism design in queueing problems
- Minimizing the Worst Slowdown: Offline, Online
- No-envy in queueing problems
- On the convexity of games corresponding to sequencing situations with due dates.
- On the convexity of precedence sequencing games
- On the reduced game property and its converse
- Scheduling with Opting Out: Improving upon Random Priority
- Sequencing games
- Sequencing games with controllable processing times
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)
