The following pages link to STACS 2004 (Q5309735):
Displaying 34 items.
- Approximate composable truthful mechanism design (Q344791) (← links)
- A truthful constant approximation for maximizing the minimum load on related machines (Q388122) (← links)
- 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)
- Copula-based randomized mechanisms for truthful scheduling on two unrelated machines (Q904694) (← links)
- A monotone approximation algorithm for scheduling with precedence constraints (Q935240) (← links)
- Deterministic monotone algorithms for scheduling on related machines (Q952439) (← links)
- Fast payment schemes for truthful mechanisms with verification (Q1006066) (← links)
- Tighter approximation bounds for LPT scheduling in two special cases (Q1026246) (← links)
- Maximizing the minimum load for selfish agents (Q1041221) (← links)
- On truthfulness and approximation for scheduling selfish tasks (Q1041343) (← links)
- A truthful mechanism for interval scheduling (Q1617651) (← links)
- Incentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobs (Q1744245) (← links)
- A lower bound of \(1+\varphi \) for truthful scheduling mechanisms (Q1949759) (← links)
- Multistage interval scheduling games (Q2283299) (← links)
- Truthful approximation mechanisms for scheduling selfish related machines (Q2643141) (← links)
- Approximations and auctions for scheduling batches on related machines (Q2643820) (← links)
- Diffusion auction design (Q2667812) (← links)
- A unified approach to truthful scheduling on related machines (Q2800378) (← links)
- A deterministic truthful PTAS for scheduling related machines (Q2862203) (← links)
- Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem (Q3196401) (← links)
- A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints (Q3602833) (← links)
- Asynchronous Congestion Games (Q3655138) (← links)
- Truthful Mechanisms for Allocating a Single Processor to Sporadic Tasks in Competitive Real-Time Environments (Q5268114) (← links)
- (Q5417684) (← links)
- Preemptive Scheduling on Selfish Machines (Q5458506) (← links)
- Maximizing the Minimum Load for Selfish Agents (Q5458534) (← links)
- Prior-independent mechanisms for scheduling (Q5495775) (← links)
- Structural Information and Communication Complexity (Q5710093) (← links)
- STACS 2005 (Q5710720) (← links)
- A new lower bound for deterministic truthful scheduling (Q5918088) (← links)
