Abstract
Algorithmic mechanism design considers distributed settings where the participants, termed agents, cannot be assumed to follow the protocol but rather their own interests. The protocol can be regarded as an algorithm augmented with a suitable payment rule and the desired condition is termed truthfulness, meaning that it is never convenient for an agent to report false information.
Motivated by the applications, we extend the usual one-parameter and multi-parameter settings by considering agents with private capacities: each agent can misreport her cost for “executing” a single unit of work and the maximum amount of work that each agent can actually execute (i.e., the capacity of the agent). We show that truthfulness in this setting is equivalent to a simple condition on the underlying algorithm. By applying this result to various problems considered in the literature (e.g., makespan minimization on related machines) we show that only some of the existing approaches to the case “without capacities” can be adapted to the case with private capacities. This poses new interesting algorithmic challenges.
Research funded by the European Union through IST FET Integrated Project AEOLUS (IST-015964).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Andelman, N., Azar, Y., Sorani, M.: Truthful Approximation Mechanisms for Scheduling Selfish Related Machines. Theory of Computing Systems 40(4), 423–436 (2007)
Archer, A., Tardos, É.: Truthful mechanisms for one-parameter agents. In: Proc. of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 482–491 (2001)
Auletta, V., Penna, P., Persiano, G.: Private capacities in mechanism design. Technical report, AEOLUS (2009), http://www.dia.unisa.it/~penna/papers/capacitated-md-full.pdf
Bikhchandani, S., Chatterji, S., Lavi, R., Mu’alem, A., Nisan, N., Sen, A.: Weak monotonicity characterizes deterministic dominant strategy implementation. Econometrica 74(4), 1109–1132 (2006)
Clarke, E.H.: Multipart Pricing of Public Goods. Public Choice, 17–33 (1971)
Dobzinski, S., Lavi, R., Nisan, N.: Multi-unit auctions with budget limits. In: FOCS, pp. 260–269. IEEE Computer Society, Los Alamitos (2008)
Groves, T.: Incentive in Teams. Econometrica 41, 617–631 (1973)
Gui, H., Muller, R., Vohra, R.V.: Dominant strategy mechanisms with multidimensional types. Discussion Papers 1392, Northwestern University, Center for Mathematical Studies in Economics and Management Science (July 2004)
Kovács, A.: Fast monotone 3-approximation algorithm for scheduling related machines. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 616–627. Springer, Heidelberg (2005)
Lavi, R., Swamy, C.: Truthful mechanism design for multidimensional scheduling via cycle monotonicity. Games and Economic Behavior (2008) (in press), doi:10.1016/j.geb.2008.08.001
Mu’alem, A., Schapira, M.: Setting lower bounds on truthfulness. In: Proc. of annual ACM symposium on discrete algorithms (SODA), pp. 1143–1152 (2007)
Myerson, R.B.: Optimal auction design. Mathematics of Operations Research 6, 58–73 (1981)
Nisan, N., Ronen, A.: Algorithmic Mechanism Design. Games and Economic Behavior 35, 166–196 (2001); Extended abstract in the Proc. of the 31st Annual ACM Symposium on Theory of Computing (STOC), pp. 129–140 (1999)
Roberts, K.: The characterization of implementable choice rules. Aggregation and Revelation of Preferences, 321–348 (1979)
Rochet, J.-C.: A necessary and sufficient condition for rationalizability in a quasi-linear context. Journal of Mathematical Economics 16(2), 191–200 (1987)
Saks, M., Yu, L.: Weak monotonicity suffices for truthfulness on convex domains. In: Proceedings of the 6th ACM conference on Electronic commerce (EC), pp. 286–293. ACM, New York (2005)
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
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Auletta, V., Penna, P., Persiano, G. (2009). Private Capacities in Mechanism Design. In: Královič, R., Niwiński, D. (eds) Mathematical Foundations of Computer Science 2009. MFCS 2009. Lecture Notes in Computer Science, vol 5734. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03816-7_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-03816-7_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03815-0
Online ISBN: 978-3-642-03816-7
eBook Packages: Computer ScienceComputer Science (R0)