Selfish bin covering
From MaRDI portal
Publication:650947
DOI10.1016/J.TCS.2011.09.017zbMATH Open1228.91014OpenAlexW2127353230MaRDI QIDQ650947FDOQ650947
Authors: Zhigang Cao, Xiaoguang Yang 
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
Recommendations
Cites Work
- Algorithmic Game Theory
- Worst-case equilibria
- Title not available (Why is that?)
- An asymptotic fully polynomial time approximation scheme for bin covering.
- Better approximation algorithms for bin covering
- On a dual version of the one-dimensional bin packing problem
- Selfish bin packing
- The stability of hedonic coalition structures
- Bounds on Multiprocessing Timing Anomalies
- A new index of power for simple n-person games
- Optimal on-line algorithms for variable-sized bin covering
- Probabilistic analysis of algorithms for dual bin packing problems
- On the Complexity of Cooperative Solution Concepts
- Title not available (Why is that?)
- NP-completeness for calculating power indices of weighted majority games
- Approximate Strong Equilibrium in Job Scheduling Games
- Title not available (Why is that?)
- Equilibria in load balancing games
- Two simple algorithms for bin covering
- Linear Time Algorithms for Knapsack Problems with Bounded Weights
Cited In (4)
Uses Software
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)
