Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2079324 (Why is no real title available?)
- scientific article; zbMATH DE number 1766750 (Why is no real title available?)
- A new index of power for simple n-person games
- Algorithmic Game Theory
- An asymptotic fully polynomial time approximation scheme for bin covering.
- Approximate Strong Equilibrium in Job Scheduling Games
- Better approximation algorithms for bin covering
- Bounds on Multiprocessing Timing Anomalies
- Equilibria in load balancing games
- Linear Time Algorithms for Knapsack Problems with Bounded Weights
- NP-completeness for calculating power indices of weighted majority games
- On a dual version of the one-dimensional bin packing problem
- On the Complexity of Cooperative Solution Concepts
- Optimal on-line algorithms for variable-sized bin covering
- Probabilistic analysis of algorithms for dual bin packing problems
- Selfish bin packing
- The stability of hedonic coalition structures
- Two simple algorithms for bin covering
- Worst-case equilibria
Cited in
(4)
This page was built for publication: Selfish bin covering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650947)