Approximate Core Allocation for Binpacking Games

DOI10.1137/S0895480296308074MaRDI QIDQ4210213zbMATH OpenOpenAlexFDO

Authors U. Faigle, Walter Kern

Publication date 21 September 1998

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480296308074

zbMATH Keywords

\(N\)-person gamebinpackingcorecost

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Cooperative games (91A12)

Recommendations

• Approximate core allocations and integrality gap for the bin packing game
• The 1/4-core of the uniform bin packing game is nonempty
• Improved Taxation Rate for Bin Packing Games
• Integrality gap analysis for bin packing games
• Note on non-uniform bin packing games

Cited in

(12)

• Integrality gap analysis for bin packing games
• Selfish colorful bin packing games
• Note on non-uniform bin packing games
• 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
• The Subset Sum game
• Stability and fairness in models with a multiple membership
• The 1/4-core of the uniform bin packing game is nonempty
• Approximate core allocations for edge cover games
• Approximate core allocations for edge cover games
• Lipschitz continuous allocations for optimization games
• Complexity of core allocation for the bin packing game

This page was built for publication: Approximate Core Allocation for Binpacking Games

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