Complexity of core allocation for the bin packing game

DOI10.1016/j.orl.2009.02.009zbMath1188.91028OpenAlexW2061715804MaRDI QIDQ833586

Zhixin Liu

Publication date: 14 August 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2009.02.009

zbMATH Keywords

core allocationbin packing gamecore emptiness testcore membership test

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Cooperative games (91A12) (n)-person games, (n>2) (91A06) Inventory, storage, reservoirs (90B05)

Related Items

Approximate core allocations and integrality gap for the bin packing game ⋮ A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games ⋮ Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation ⋮ Simultaneous Penalization and Subsidization for Stabilizing Grand Cooperation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bin packing games
• On some approximately balanced combinatorial cooperative games
• Approximate Core Allocation for Binpacking Games
• On the Complexity of Cooperative Solution Concepts
• On the rate of taxation in a cooperative bin packing game
• Algorithmic Aspects of the Core of Combinatorial Optimization Games
• Quasi-Cores in a Monetary Economy with Nonconvex Preferences

This page was built for publication: Complexity of core allocation for the bin packing game