The following pages link to The Santa Claus problem (Q2931367):
Displaying 50 items.
- Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
- Maximizing Nash product social welfare in allocating indivisible goods (Q320030) (← links)
- Finding a collective set of items: from proportional multirepresentation to group recommendation (Q334810) (← links)
- A truthful constant approximation for maximizing the minimum load on related machines (Q388122) (← links)
- Maximizing the minimum load: the cost of selfishness (Q390908) (← links)
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines (Q463715) (← links)
- Fair division of indivisible items between two players: design parameters for contested pile methods (Q483924) (← links)
- Online scheduling with rejection and reordering: exact algorithms for unit size jobs (Q489737) (← links)
- On the configuration-LP for scheduling on unrelated machines (Q490331) (← links)
- Assigning sporadic tasks to unrelated machines (Q494326) (← links)
- Online scheduling with rejection and withdrawal (Q650898) (← links)
- On-line machine covering on two machines with local migration (Q660883) (← links)
- The efficiency of fair division (Q692886) (← links)
- Inefficiency of equilibria for the machine covering game on uniform machines (Q715052) (← links)
- On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
- Two-player fair division of indivisible items: comparison of algorithms (Q724147) (← links)
- On \((1, \epsilon )\)-restricted max-min fair allocation problem (Q724228) (← links)
- Strong LP formulations for scheduling splittable jobs on unrelated machines (Q896269) (← links)
- On the configuration LP for maximum budgeted allocation (Q896296) (← links)
- The hierarchical model for load balancing on two machines (Q927189) (← links)
- Semi-online machine covering for two uniform machines (Q1034625) (← links)
- Maximizing the minimum load for selfish agents (Q1041221) (← links)
- Online-bounded analysis (Q1617274) (← links)
- Setting lower bounds on truthfulness (Q1651232) (← links)
- Estimating the makespan of the two-valued restricted assignment problem (Q1751100) (← links)
- The cost of selfishness for maximizing the minimum load on uniformly related machines (Q2015810) (← links)
- Contention resolution, matrix scaling and fair allocation (Q2085755) (← links)
- Restricted max-min allocation: integrality gap and approximation algorithm (Q2149096) (← links)
- A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds (Q2164700) (← links)
- The price to pay for forgoing normalization in fair division of indivisible goods (Q2202518) (← links)
- A note on the integrality gap of the configuration LP for restricted Santa Claus (Q2203609) (← links)
- Fair-by-design matching (Q2212506) (← links)
- On the star decomposition of a graph: hardness results and approximation for the max-min optimization problem (Q2217500) (← links)
- The price of fairness for indivisible goods (Q2230722) (← links)
- A new approach for bicriteria partitioning problem (Q2355323) (← 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)
- General max-min fair allocation (Q2695275) (← links)
- Allocating indivisible items with minimum dissatisfaction on preference graphs (Q2695444) (← links)
- Minimizing and balancing envy among agents using ordered weighted average (Q2695450) (← links)
- Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
- A unified approach to truthful scheduling on related machines (Q2800378) (← links)
- A Protocol for Cutting Matroids Like Cakes (Q2937759) (← links)
- Approximation Algorithms for Computing Maximin Share Allocations (Q3448772) (← links)
- Min Sum Edge Coloring in Multigraphs Via Configuration LP (Q3503859) (← links)
- Santa Claus Meets Hypergraph Matchings (Q3541783) (← links)
- Approximating the Nash Social Welfare with Indivisible Items (Q4571931) (← links)
- Nash Social Welfare, Matrix Permanent, and Stable Polynomials (Q4638089) (← links)
