Recommendations
Cited in
(96)- Semi-online machine covering for two uniform machines
- Maximizing the minimum load for selfish agents
- Online-bounded analysis
- Setting lower bounds on truthfulness
- Estimating the makespan of the two-valued restricted assignment problem
- The cost of selfishness for maximizing the minimum load on uniformly related machines
- Contention resolution, matrix scaling and fair allocation
- Restricted max-min allocation: integrality gap and approximation algorithm
- A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds
- The price to pay for forgoing normalization in fair division of indivisible goods
- A note on the integrality gap of the configuration LP for restricted Santa Claus
- Fair-by-design matching
- On the star decomposition of a graph: hardness results and approximation for the max-min optimization problem
- The price of fairness for indivisible goods
- A new approach for bicriteria partitioning problem
- A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation
- Graph balancing: a special case of scheduling unrelated parallel machines
- Multistage online maxmin allocation of indivisible entities
- Fair and efficient allocation with few agent types, few item types, or small value levels
- General max-min fair allocation
- Allocating indivisible items with minimum dissatisfaction on preference graphs
- Minimizing and balancing envy among agents using ordered weighted average
- Fair allocation of indivisible items with conflict graphs
- A unified approach to truthful scheduling on related machines
- A protocol for cutting matroids like cakes
- Integrality gaps for strengthened linear relaxations of capacitated facility location
- Maximizing Nash product social welfare in allocating indivisible goods
- Finding a collective set of items: from proportional multirepresentation to group recommendation
- Approximation algorithms for computing maximin share allocations
- Min Sum Edge Coloring in Multigraphs Via Configuration LP
- Santa Claus Meets Hypergraph Matchings
- A truthful constant approximation for maximizing the minimum load on related machines
- Maximizing the minimum load: the cost of selfishness
- Approximating the Nash Social Welfare with Indivisible Items
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines
- Nash social welfare, matrix permanent, and stable polynomials
- Fair division of indivisible items between two players: design parameters for contested pile methods
- Online scheduling with rejection and reordering: exact algorithms for unit size jobs
- On the configuration-LP for scheduling on unrelated machines
- Assigning sporadic tasks to unrelated machines
- Restricted Max-Min Fair Allocation
- Fair Packing of Independent Sets
- Graph balancing with orientation costs
- Restricted max-min allocation: approximation and integrality gap
- Local search breaks 1.75 for graph balancing
- A quasi-polynomial approximation for the restricted assignment problem
- Coalition formation in social environments with logic-based agents1
- Duplication monotonicity in the allocation of indivisible goods
- scientific article; zbMATH DE number 7415106 (Why is no real title available?)
- Lazy local search meets machine scheduling
- Compact LP relaxations for allocation problems
- Maximizing the Minimum Load for Selfish Agents
- Online bounded analysis
- The snowblower problem
- The snowblower problem
- The existence of universally agreed fairest semi-matchings in any given bipartite graph
- Fair allocation algorithms for indivisible items under structured conflict constraints
- Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings
- Machine covering in the random-order model
- Online max-min fair allocation
- Resource time-sharing for IoT applications with deadlines
- Fair division of indivisible goods: recent progress and open questions
- Allocation of indivisible items with individual preference graphs
- Polynomial-time combinatorial algorithm for general max-min fair allocation
- Approximating Nash social welfare by matching and local search
- Better trees for Santa Claus
- Online scheduling with rejection and withdrawal
- Maximin fair allocation of indivisible items under cost utilities
- A constant-factor approximation for generalized malleable scheduling under \(M^{\natural }\)-concave processing speeds
- Collective decision making
- On-line machine covering on two machines with local migration
- Time-sharing scheduling with tolerance capacities
- Fair and efficient graphical resource allocation with matching-induced utilities
- A geometric programming approach to solve the restricted assignment case of the Santa Claus problem
- Scheduling splittable jobs on configurable machines
- The efficiency of fair division
- On min-max graph balancing with strict negative correlation constraints
- Approximate maximin share allocation for indivisible goods under a knapsack constraint
- Worst-case fair guarantees when spending a common budget
- Fast algorithms for maximizing the minimum eigenvalue in fixed dimension
- Improved integrality gap in max-min allocation, or, topology at the north pole
- Inefficiency of multiplicative approximate Nash equilibrium for scheduling games
- Inefficiency of equilibria for the machine covering game on uniform machines
- On linear and semidefinite programming relaxations for hypergraph matching
- The submodular Santa Claus problem in the restricted assignment case
- Additive approximation schemes for load balancing problems
- Truthful allocation in graphs and hypergraphs
- Two-player fair division of indivisible items: comparison of algorithms
- On \((1, \epsilon )\)-restricted max-min fair allocation problem
- An algorithmic framework for black-box reductions from Bayesian mechanism design to algorithm design
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Strong LP formulations for scheduling splittable jobs on unrelated machines
- On the configuration LP for maximum budgeted allocation
- The hierarchical model for load balancing on two machines
This page was built for publication: The Santa Claus problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931367)
