Pages that link to "Item:Q5171208"
From MaRDI portal
The following pages link to On Allocating Goods to Maximize Fairness (Q5171208):
Displaying 36 items.
- A truthful constant approximation for maximizing the minimum load on related machines (Q388122) (← links)
- On the configuration-LP for scheduling on unrelated machines (Q490331) (← links)
- Maximin fairness in project budget allocation (Q510932) (← links)
- The efficiency of fair division (Q692886) (← links)
- On \((1, \epsilon )\)-restricted max-min fair allocation problem (Q724228) (← links)
- On the configuration LP for maximum budgeted allocation (Q896296) (← links)
- Fair welfare maximization (Q1031840) (← links)
- A class of fair distribution rules à la Rawls and Sen (Q1407772) (← links)
- A theorem on utilitarian redistribution (Q1804620) (← links)
- On fair allocations and monetary compensations (Q1906032) (← links)
- Rawlsian fairness in push and pull supply chains (Q2029962) (← links)
- Restricted max-min allocation: integrality gap and approximation algorithm (Q2149096) (← links)
- Parameterized orientable deletion (Q2182093) (← links)
- Structural parameters for scheduling with assignment restrictions (Q2205947) (← links)
- On the star decomposition of a graph: hardness results and approximation for the max-min optimization problem (Q2217500) (← links)
- Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints (Q2222091) (← 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)
- How to allocate hard candies fairly (Q2463574) (← 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)
- General max-min fair allocation (Q2695275) (← links)
- Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
- LP-Based Algorithms for Capacitated Facility Location (Q2968155) (← links)
- (Q3646778) (← links)
- Approximating the Nash Social Welfare with Indivisible Items (Q4571931) (← links)
- Nash Social Welfare, Matrix Permanent, and Stable Polynomials (Q4638089) (← links)
- Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines (Q4997316) (← links)
- Restricted Max-Min Fair Allocation (Q5002708) (← links)
- (Q5091188) (← links)
- (Q5091233) (← links)
- (Q5116488) (← links)
- (Q5874477) (← links)
- An EPTAS for scheduling on unrelated machines of few different types (Q5919620) (← links)
- Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs (Q6065410) (← links)
- Polynomial-time combinatorial algorithm for general max-min fair allocation (Q6182677) (← links)
