Selfish bin covering
From MaRDI portal
Publication:650947
DOI10.1016/j.tcs.2011.09.017zbMath1228.91014OpenAlexW2127353230MaRDI QIDQ650947
Publication date: 7 December 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.09.017
Related Items (3)
An Incentive Mechanism for Selfish Bin Covering ⋮ Selfish colorful bin packing games ⋮ From packing rules to cost-sharing mechanisms
Uses Software
Cites Work
- Selfish bin packing
- The stability of hedonic coalition structures
- Equilibria in load balancing games
- A new index of power for simple n-person games
- Optimal on-line algorithms for variable-sized bin covering
- An asymptotic fully polynomial time approximation scheme for bin covering.
- On a dual version of the one-dimensional bin packing problem
- Probabilistic analysis of algorithms for dual bin packing problems
- On the Complexity of Cooperative Solution Concepts
- Linear Time Algorithms for Knapsack Problems with Bounded Weights
- Algorithmic Game Theory
- Approximate Strong Equilibrium in Job Scheduling Games
- Bounds on Multiprocessing Timing Anomalies
- NP-completeness for calculating power indices of weighted majority games
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Selfish bin covering