Abstract
We study combinatorial optimization problems involving one-parameter selfish agents considered by Archer and Tardos [FOCS 2001]. In particular, we show that, if agents can lie in one direction (that is they either overbid or underbid) then any (polynomial-time) c-approximation algorithm, for the optimization problem without selfish agents, can be turned into a (polynomial-time) c(1+ε)-approximation truthful mechanism, for any ε >0. We then look at the Q||C max problem in the case of agents owning machines of different speeds. We consider the model in which payments are given to the agents only after the machines have completed the jobs assigned. This means that for each machine that receives at least one job, the mechanism can verify if the corresponding agent declared a greater speed. For this setting, we characterize the allocation algorithms A that admit a payment function P such that M=(A,P) is a truthful mechanism. In addition, we give a (1+ε)-approximation truthful mechanism for Q||C max when machine speeds are bounded by a constant. Finally, we consider the classical scheduling problem Q|| ∑ w j C j which does not admit an exact mechanism if verification is not allowed. By contrast, we show that an exact mechanism for Q|| ∑ w j C j exists when verification is allowed.
Work supported by the European Project IST-2001-33135, Critical Resource Sharing for Cooperation in Complex Systems (CRESCCO).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Archer, A., Tardos, E.: Truthful mechanisms for one-parameter agents. In: Proc. of the IEEE Symposium on Foundations of Computer Science, pp. 482–491 (2001)
Auletta, V., De Prisco, R., Penna, P., Persiano, G.: Deterministic truthful approximation mechanisms for scheduling related machines. Technical report, To appear in Proceedings of STACS 2004 (2004)
Auletta, V., De Prisco, R., Penna, P., Persiano, G.: How to tax and route selfish unsplittable traffic. Technical report, To appear in Proceedings of SPAA (2004)
Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and their Approximability Properties. Springer, Heidelberg (1999)
Clarke, E.H.: Multipart Pricing of Public Goods. Public Choice, 17–33 (1971)
Groves, T.: Incentive in Teams. Econometrica 41, 617–631 (1973)
Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: theoretical and practical results. J. of ACM 34, 144–162 (1987)
Nisan, N., Ronen, A.: Algorithmic Mechanism Design. In: Proc. of the 31st Annual ACM Symposium on Theory of Computing, pp. 129–140 (1999)
Vickrey, W.: Counterspeculation, Auctions and Competitive Sealed Tenders. Journal of Finance, 8–37 (1961)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Auletta, V., De Prisco, R., Penna, P., Persiano, G. (2004). The Power of Verification for One-Parameter Agents. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds) Automata, Languages and Programming. ICALP 2004. Lecture Notes in Computer Science, vol 3142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27836-8_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-27836-8_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22849-3
Online ISBN: 978-3-540-27836-8
eBook Packages: Springer Book Archive