Queueing games with an endogenous number of machines
From MaRDI portal
Publication:6494256
DOI10.1016/J.GEB.2024.01.005WikidataQ129663198 ScholiaQ129663198MaRDI QIDQ6494256
Publication date: 30 April 2024
Published in: Games and Economic Behavior (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fair queueing
- Step out-step in sequencing games
- On the core of cooperative queueing games
- Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency
- Welfare lower bounds and strategy-proofness in the queueing problem
- Group strategyproofness in queueing models
- Optimal sharing of surgical costs in the presence of queues.
- Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
- Properties of 1-convex \(n\)-person games
- Sequencing games
- On a new class of parallel sequencing situations and related games
- Incomplete information and multiple machine queueing problems
- A characterization of the Shapley value in queueing problems
- Weak group strategy-proof and queue-efficient mechanisms for the queueing problem with multiple machines
- Reduced two-bound core games
- Open shop scheduling games
- Stability and fairness in the job scheduling problem
- Balanced implementability of sequencing rules
- A characterization of the symmetrically balanced VCG rule in the queueing problem
- Incentives and justice for sequencing problems
- Cooperation in Markovian queueing models
- A pessimistic approach to the queueing problem
- Cores of convex games
- The assignment game. I: The core
- Cooperation in one machine scheduling
- No-envy in the Queueing Problem with Multiple Identical Machines
- Relaxed sequencing games have a nonempty core
This page was built for publication: Queueing games with an endogenous number of machines
