Note on non-uniform bin packing games
From MaRDI portal
Publication:2448901
Recommendations
Cites work
- Approximate Core Allocation for Binpacking Games
- Bin packing can be solved within 1+epsilon in linear time
- Bin packing games
- Extensions of solution concepts by means of muliplicative \(\epsilon\)-tax games
- Improved Taxation Rate for Bin Packing Games
- On some approximately balanced combinatorial cooperative games
- On the rate of taxation in a cooperative bin packing game
- Quasi-Cores in a Monetary Economy with Nonconvex Preferences
Cited in
(8)- Bin packing games
- Bin packing game with a price of anarchy of \(\frac{3}{2}\)
- Integrality gap analysis for bin packing games
- Non-uniform packings
- On weighted balls-into-bins games
- Approximate core allocations and integrality gap for the bin packing game
- Approximate Core Allocation for Binpacking Games
- The 1/4-core of the uniform bin packing game is nonempty
This page was built for publication: Note on non-uniform bin packing games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2448901)