Integer-splittable bin packing games

DOI10.1007/978-3-032-18660-7_17MaRDI QIDQ7299274zbMATH OpenFDO

Authors Bainian Hao, Carla Michini

Publication date 17 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-18660-7_17

Mathematics Subject Classification ID

Internet topics (68M11) Applications of game theory (91A80) Auctions, bargaining, bidding and selling, and other market models (91B26)

Cites work

• A logarithmic additive integrality gap for bin packing
• A note on a selfish bin packing problem
• Bin packing can be solved within 1+epsilon in linear time
• Bin packing games with weight decision: how to get a small value for the price of anarchy
• Capacitated network design games with weighted players
• Cost-sharing mechanisms for selfish bin packing
• Nash equilibria in discrete routing games with convex latency functions
• Network design with weighted players
• On the existence of pure strategy Nash equilibria in integer-splittable weighted congestion games
• Parametric packing of selfish items and the subset sum algorithm
• Potential games
• Quality of strong equilibria for selfish bin packing with uniform cost sharing
• Selfish bin packing
• Sensitivity analysis for convex separable optimization over integral polymatroids
• STACS 2004
• The network equilibrium problem in integers
• The price of stability for network design with fair cost allocation
• Uniqueness of equilibria in atomic splittable polymatroid congestion games
• Using weight decision for decreasing the price of anarchy in selfish bin packing games
• Worst-case equilibria

This page was built for publication: Integer-splittable bin packing games

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