Recent developments in the queueing problem
From MaRDI portal
Publication:2421321
DOI10.1007/s11750-019-00499-0zbMath1415.90025OpenAlexW2912794643MaRDI QIDQ2421321
Suresh Mutuswami, Manipushpak Mitra, Youngsub Chun
Publication date: 17 June 2019
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-019-00499-0
queueing problemstrategic approachnormative approachbargaining approachcooperative game theoretic approach
Cooperative games (91A12) Applications of game theory (91A80) Queues and service in operations research (90B22) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)
Related Items
Comments on: ``Recent developments in the queueing problem ⋮ Balanced VCG mechanisms for sequencing problems ⋮ No-envy in the Queueing Problem with Multiple Identical Machines
Cites Work
- Unnamed Item
- Fair queueing
- Auctioning and selling positions: a non-cooperative approach to queueing conflicts
- Balanced consistency and balanced cost reduction for sequencing problems
- Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency
- Characterizations of pivotal mechanisms in the queueing problem
- Assigning agents to a line
- Welfare lower bounds and strategy-proofness in the queueing problem
- Consistency and monotonicity in sequencing problems
- When queueing is better than push and shove
- Group strategyproofness in queueing models
- Simple sequencing problems with interdependent costs
- Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
- Fair division under joint ownership: Recent results and open problems
- On the nonexistence of envy-free and egalitarian-equivalent allocations in economies with indivisibilities
- On the coincidence of the prenucleolus and the Shapley value
- Implementing cooperative solution concepts: a generalized bidding approach
- An axiomatization of the \(\tau\)-value
- Sequencing games
- Welfare bounds in the fair division problem
- Decreasing serial cost sharing under economies of scale
- Reordering an existing queue
- Incomplete information and multiple machine queueing problems
- A characterization of the Shapley value in queueing problems
- Achieving the first best in sequencing problems.
- Identical preferences lower bound solution and consistency in economies with indivisible goods
- Weak group strategy-proof and queue-efficient mechanisms for the queueing problem with multiple machines
- Egalitarian equivalence and strategyproofness in the queueing problem
- A characterization of the symmetrically balanced VCG rule in the queueing problem
- Incentives in landing slot problems
- A graph theoretic approach to the slot allocation problem
- Efficiency and compromise: a bid-offer-counteroffer mechanism with two players
- Incentives and justice for sequencing problems
- No-envy in queueing problems
- A pessimistic approach to the queueing problem
- Large Indivisibles: An Analysis with Respect to Price Equilibrium and Fairness
- Scheduling with Opting Out: Improving upon Random Priority
- Bargaining Foundations of Shapely Value
- Serial Cost Sharing
- Incentives in Teams
- Groves' Scheme on Restricted Domains
- On the Complexity of Cooperative Solution Concepts
- A Game Theoretic Approach to Problems in Telecommunication
- On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs
- The Nucleolus of a Characteristic Function Game
- Bargaining and Value
- Mechanism design in queueing problems
- Bidding for the surplus: a non-cooperative approach to the Shapley value
