Approximate Core Allocation for Binpacking Games

DOI10.1137/S0895480296308074zbMath0910.90237OpenAlexW2128037400MaRDI QIDQ4210213

Walter Kern, Ulrich Faigle

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

corecost\(N\)-person gamebinpacking

Mathematics Subject Classification ID

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

Related Items (9)

Approximate core allocations and integrality gap for the bin packing game ⋮ Complexity of core allocation for the bin packing game ⋮ The Subset Sum game ⋮ Stability and fairness in models with a multiple membership ⋮ A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games ⋮ Approximate core allocations for edge cover games ⋮ Note on non-uniform bin packing games ⋮ Integrality gap analysis for bin packing games ⋮ Selfish colorful bin packing games

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