An Incentive Mechanism for Selfish Bin Covering
From MaRDI portal
Publication:2958351
DOI10.1007/978-3-319-48749-6_46zbMath1484.91111OpenAlexW2542068888MaRDI QIDQ2958351
Wenjing Liu, Qizhi Fang, Weian Li
Publication date: 1 February 2017
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-48749-6_46
Nash equilibriumincentive mechanismselfish bin coveringprice of anarchy (PoA)price of stability (PoS)
Related Items (3)
On various open-end bin packing game ⋮ An improved mechanism for selfish bin packing ⋮ From packing rules to cost-sharing mechanisms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Selfish bin packing with cardinality constraints
- Selfish bin packing
- Selfish bin covering
- An asymptotic fully polynomial time approximation scheme for bin covering.
- A note on a selfish bin packing problem
- On a dual version of the one-dimensional bin packing problem
- Algorithms, games, and the internet
This page was built for publication: An Incentive Mechanism for Selfish Bin Covering