The following pages link to Algorithms – ESA 2005 (Q5475870):
Displaying 22 items.
- Truthful mechanism design via correlated tree rounding (Q526848) (← links)
- Distributed algorithmic mechanism design for scheduling on unrelated machines (Q635328) (← links)
- Truthful mechanism design for multidimensional scheduling via cycle monotonicity (Q834857) (← links)
- On designing truthful mechanisms for online scheduling (Q838147) (← links)
- Truthful algorithms for scheduling selfish tasks on parallel machines (Q861258) (← links)
- Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems (Q935148) (← links)
- A monotone approximation algorithm for scheduling with precedence constraints (Q935240) (← links)
- The power of verification for one-parameter agents (Q1004286) (← links)
- Truthful mechanisms for two-range-values variant of unrelated scheduling (Q1019737) (← links)
- Tighter approximation bounds for LPT scheduling in two special cases (Q1026246) (← links)
- A lower bound for scheduling mechanisms (Q1031874) (← links)
- Maximizing the minimum load for selfish agents (Q1041221) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- A lower bound of \(1+\varphi \) for truthful scheduling mechanisms (Q1949759) (← links)
- Multistage interval scheduling games (Q2283299) (← links)
- Approximations and auctions for scheduling batches on related machines (Q2643820) (← links)
- A Unified Approach to Truthful Scheduling on Related Machines (Q2800378) (← links)
- Private Capacities in Mechanism Design (Q3182917) (← links)
- A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints (Q3602833) (← links)
- Preemptive Scheduling on Selfish Machines (Q5458506) (← links)
- Maximizing the Minimum Load for Selfish Agents (Q5458534) (← links)
- Well-behaved online load balancing against strategic jobs (Q6090218) (← links)
