Complexity of core allocation for the bin packing game

DOI10.1016/J.ORL.2009.02.009MaRDI QIDQ833586zbMATH OpenOpenAlexFDO

Authors 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) Cooperative games (91A12) Abstract computational complexity for mathematical programming problems (90C60) Inventory, storage, reservoirs (90B05) (n)-person games, (n>2) (91A06)

Recommendations

• Approximate Core Allocation for Binpacking Games
• Publication:4944178
• Approximate core allocations and integrality gap for the bin packing game
• scientific article; zbMATH DE number 3952477
• Integrality gap analysis for bin packing games
• Complexity of fragmentable object bin packing and an application
• A bin packing game with cardinality constraints under the best cost rule
• Bin packing game with a price of anarchy of \(\frac{3}{2}\)
• Models and complexity of multibin packing problems
• scientific article; zbMATH DE number 3997164

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A minimum taxrate core allocation of bin packing games
• Algorithmic Aspects of the Core of Combinatorial Optimization Games
• Approximate Core Allocation for Binpacking Games
• Approximation algorithms for NP-hard problems.
• Bin packing games
• On some approximately balanced combinatorial cooperative games
• On the Complexity of Cooperative Solution Concepts
• On the rate of taxation in a cooperative bin packing game
• Quasi-Cores in a Monetary Economy with Nonconvex Preferences

Cited in

(7)

• 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
• Simultaneous penalization and subsidization for stabilizing grand cooperation
• Bin packing game with a price of anarchy of \(\frac{3}{2}\)
• Algorithmic solutions for maximizing shareable costs
• scientific article; zbMATH DE number 1417714 (Why is no real title available?)
• Computing near-optimal stable cost allocations for cooperative games by Lagrangian relaxation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833586)