Balanced consistency and balanced cost reduction for sequencing problems
From MaRDI portal
Publication:427519
DOI10.1007/S00355-011-0533-6zbMath1239.91051OpenAlexW2076642620MaRDI QIDQ427519
Youngsub Chun, René van den Brink
Publication date: 13 June 2012
Published in: Social Choice and Welfare (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00355-011-0533-6
Related Items (4)
The balanced contributions property for equal contributors ⋮ Recent developments in the queueing problem ⋮ Auctioning and selling positions: a non-cooperative approach to queueing conflicts ⋮ Balanced externalities and the proportional allocation of nonseparable contributions
Cites Work
- Consistency and monotonicity in sequencing problems
- Problems of fair division and the egalitarian solution
- Monotonic solutions of cooperative games
- The solidarity axiom for quasilinear social choice problems
- Sequencing games
- Conference structures and fair allocation rules
- An axiomatization of the Shapley value using a fairness property
- A characterization of the Shapley value in queueing problems
- Achieving the first best in sequencing problems.
- Component efficient solutions in line-graph games with applications
- Cost sharing in a job scheduling problem
- Null or nullifying players: the difference between the Shapley value and equal division solutions
- No-envy in queueing problems
- A pessimistic approach to the queueing problem
- Potential, Value, and Consistency
- Graphs and Cooperation in Games
- On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs
- Mechanism design in queueing problems
- Unnamed Item
- Unnamed Item
This page was built for publication: Balanced consistency and balanced cost reduction for sequencing problems
