Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Algorithmic mechanism design (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
An approximate truthful mechanism for combinatorial auctions with single parameter agents
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Incentive compatible multi unit combinatorial auctions
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
Truthful Mechanisms for One-Parameter Agents
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Towards a Characterization of Truthful Combinatorial Auctions
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Mechanisms for discrete optimization with rational agents
Mechanisms for discrete optimization with rational agents
Approximation techniques for utilitarian mechanism design
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Approximation algorithms for combinatorial auctions with complement-free bidders
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Weak monotonicity suffices for truthfulness on convex domains
Proceedings of the 6th ACM conference on Electronic commerce
Truthful randomized mechanisms for combinatorial auctions
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Mechanism design for single-value domains
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Fast monotone 3-approximation algorithm for scheduling related machines
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Truthful approximation mechanisms for scheduling selfish related machines
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity
Proceedings of the 8th ACM conference on Electronic commerce
Mechanism design over discrete domains
Proceedings of the 9th ACM conference on Electronic commerce
On characterizations of truthful mechanisms for combinatorial auctions and scheduling
Proceedings of the 9th ACM conference on Electronic commerce
A Characterization of 2-Player Mechanisms for Scheduling
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
The Power of Preemption in Economic Online Markets
GECON '08 Proceedings of the 5th international workshop on Grid Economics and Business Models
Characterizing truthful mechanisms with convex type spaces
ACM SIGecom Exchanges
Truthful mechanisms for two-range-values variant of unrelated scheduling
Theoretical Computer Science
Fair cost-sharing methods for scheduling jobs on parallel machines
Journal of Discrete Algorithms
Optimal collusion-resistant mechanisms with verification
Proceedings of the 10th ACM conference on Electronic commerce
An optimal lower bound for anonymous scheduling mechanisms
Proceedings of the 10th ACM conference on Electronic commerce
Approximate mechanism design without money
Proceedings of the 10th ACM conference on Electronic commerce
On designing truthful mechanisms for online scheduling
Theoretical Computer Science
VCG is the best anonymous scheduling mechanism
ACM SIGecom Exchanges
On 2-Player Randomized Mechanisms for Scheduling
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Mechanism design for fractional scheduling on unrelated machines
ACM Transactions on Algorithms (TALG)
Improved lower bounds for non-utilitarian truthfulness
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Asymptotically optimal strategy-proof mechanisms for two-facility games
Proceedings of the 11th ACM conference on Electronic commerce
A game-theoretic method of fair resource allocation for cloud computing services
The Journal of Supercomputing
Improved lower bounds for non-utilitarian truthfulness
Theoretical Computer Science
Multi-unit auctions: beyond roberts
Proceedings of the 12th ACM conference on Electronic commerce
On the approximability of budget feasible mechanisms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A global characterization of envy-free truthful scheduling of two tasks
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions
ACM Transactions on Computation Theory (TOCT)
A lower bound of 1 + ϕ for truthful scheduling mechanisms
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Mechanism design for fractional scheduling on unrelated machines
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Scheduling selfish tasks: about the performance of truthful algorithms
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Future Generation Computer Systems
Prior-independent mechanisms for scheduling
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Approximate Mechanism Design without Money
ACM Transactions on Economics and Computation
Hi-index | 0.01 |
We study the mechanism design problem of scheduling tasks on n unrelated machines in which the machines are the players of the mechanism. The problem was proposed and studied in the seminal paper of Nisan and Ronen, where it was shown that the approximation ratio of mechanisms is between 2 and n. We improve the lower bound to 1 + √2 for 3 or more machines.