Pages that link to "Item:Q5390583"
From MaRDI portal
The following pages link to An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods (Q5390583):
Displayed 19 items.
- On the configuration-LP for scheduling on unrelated machines (Q490331) (← links)
- The efficiency of fair division (Q692886) (← links)
- Fair assignment of indivisible objects under ordinal preferences (Q899158) (← links)
- On maximin share allocations in matroids (Q1628590) (← links)
- Worst case compromises in matroids with applications to the allocation of indivisible goods (Q2346382) (← links)
- A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation (Q2436693) (← links)
- Graph balancing: a special case of scheduling unrelated parallel machines (Q2441586) (← links)
- Multistage online maxmin allocation of indivisible entities (Q2676469) (← links)
- Fair and efficient allocation with few agent types, few item types, or small value levels (Q2680786) (← links)
- Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
- A Protocol for Cutting Matroids Like Cakes (Q2937759) (← links)
- Approximating the Nash Social Welfare with Indivisible Items (Q4571931) (← links)
- A Further Analysis of the Dynamic Dominant Resource Fairness Mechanism (Q4632212) (← links)
- (Q5159440) (← links)
- Approximate Maximin Share Allocations in Matroids (Q5283377) (← links)
- An EPTAS for scheduling on unrelated machines of few different types (Q5919620) (← links)
- Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings (Q6075859) (← links)
- Machine covering in the random-order model (Q6103518) (← links)
- Online max-min fair allocation (Q6109544) (← links)