Pages that link to "Item:Q261356"
From MaRDI portal
The following pages link to Parametric packing of selfish items and the subset sum algorithm (Q261356):
Displaying 12 items.
- Online variable-sized bin packing with conflicts (Q429693) (← links)
- Bin packing game with a price of anarchy of \(\frac{3}{2}\) (Q1702843) (← links)
- The intermediate price of anarchy (IPoA) in bin packing games (Q1744237) (← links)
- Selfish vector packing (Q1979465) (← links)
- From packing rules to cost-sharing mechanisms (Q2082177) (← links)
- Quality of equilibria for selfish bin packing with cost sharing variants (Q2218642) (← links)
- A new lower bound on the price of anarchy of selfish bin packing (Q2274500) (← links)
- Quality of strong equilibria for selfish bin packing with uniform cost sharing (Q2304118) (← links)
- On the sequential price of anarchy of isolation games (Q2354304) (← links)
- A note on a selfish bin packing problem (Q2393075) (← links)
- Pareto optimal equilibria for selfish bin packing with uniform cost sharing (Q2424651) (← links)
- Using weight decision for decreasing the price of anarchy in selfish bin packing games (Q2424774) (← links)
