Pages that link to "Item:Q3162508"
From MaRDI portal
The following pages link to Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games (Q3162508):
Displayed 10 items.
- Dividing connected chores fairly (Q500994) (← links)
- The efficiency of fair division (Q692886) (← links)
- Selfish vector packing (Q1979465) (← links)
- Magnitude of inefficiency (Q2030487) (← links)
- Dividing splittable goods evenly and with limited fragmentation (Q2309472) (← links)
- Scheduling selfish jobs on multidimensional parallel machines (Q2404079) (← links)
- Existence of a simple and equitable fair division: a short proof (Q2406943) (← links)
- Implementation of optimal schedules in outsourcing with identical suppliers (Q2417955) (← links)
- Pareto optimal equilibria for selfish bin packing with uniform cost sharing (Q2424651) (← links)
- Selfish Vector Packing (Q3452809) (← links)