Recent developments in the queueing problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3078997 (Why is no real title available?)
- A Game Theoretic Approach to Problems in Telecommunication
- A characterization of the Shapley value in queueing problems
- A characterization of the symmetrically balanced VCG rule in the queueing problem
- A graph theoretic approach to the slot allocation problem
- A pessimistic approach to the queueing problem
- Achieving the first best in sequencing problems.
- An axiomatization of the -value
- Assigning agents to a line
- Auctioning and selling positions: a non-cooperative approach to queueing conflicts
- Balanced consistency and balanced cost reduction for sequencing problems
- Bargaining Foundations of Shapely Value
- Bargaining and Value
- Bidding for the surplus: a non-cooperative approach to the Shapley value
- Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
- Characterizations of pivotal mechanisms in the queueing problem
- Consistency and monotonicity in sequencing problems
- Decreasing serial cost sharing under economies of scale
- Efficiency and compromise: a bid-offer-counteroffer mechanism with two players
- Egalitarian equivalence and strategyproofness in the queueing problem
- Fair division under joint ownership: Recent results and open problems
- Fair queueing
- Group strategyproofness in queueing models
- Groves' Scheme on Restricted Domains
- Identical preferences lower bound solution and consistency in economies with indivisible goods
- Implementing cooperative solution concepts: a generalized bidding approach
- Incentives and justice for sequencing problems
- Incentives in Teams
- Incentives in landing slot problems
- Incomplete information and multiple machine queueing problems
- Large Indivisibles: An Analysis with Respect to Price Equilibrium and Fairness
- Mechanism design in queueing problems
- No-envy in queueing problems
- On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs
- On the Complexity of Cooperative Solution Concepts
- On the coincidence of the prenucleolus and the Shapley value
- On the nonexistence of envy-free and egalitarian-equivalent allocations in economies with indivisibilities
- Reordering an existing queue
- Scheduling with Opting Out: Improving upon Random Priority
- Sequencing games
- Serial Cost Sharing
- Simple sequencing problems with interdependent costs
- Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency
- The Nucleolus of a Characteristic Function Game
- Weak group strategy-proof and queue-efficient mechanisms for the queueing problem with multiple machines
- Welfare bounds in the fair division problem
- Welfare lower bounds and strategy-proofness in the queueing problem
- When queueing is better than push and shove
Cited in
(11)- Advances in queueing models' research
- Auctioning and selling positions: a non-cooperative approach to queueing conflicts
- Fair queueing
- Balanced VCG mechanisms for sequencing problems
- A characterization of the Shapley value in queueing problems
- The on-line transfer rule for queueing with arrivals
- No-envy in the queueing problem with multiple identical machines
- scientific article; zbMATH DE number 715269 (Why is no real title available?)
- A pessimistic approach to the queueing problem
- The Shapley value in positional queueing problems
- Comments on: ``Recent developments in the queueing problem
This page was built for publication: Recent developments in the queueing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2421321)
