Pages that link to "Item:Q833586"
From MaRDI portal
The following pages link to Complexity of core allocation for the bin packing game (Q833586):
Displaying 4 items.
- Approximate core allocations and integrality gap for the bin packing game (Q265072) (← links)
- A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games (Q2664449) (← links)
- Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation (Q2960364) (← links)
- Simultaneous Penalization and Subsidization for Stabilizing Grand Cooperation (Q4971567) (← links)
