Abstract
A necessary and sufficient condition for dominant strategy implementability when preferences are quasilinear is that, for every individual i and every choice of the types of the other individuals, all k-cycles in i’s allocation graph have nonnegative length for every integer k ≥ 2. Saks and Yu (Proceedings of the 6th ACM conference on electronic commerce (EC’05), pp 286–293, 2005) have shown that when the number of outcomes is finite and i’s valuation type space is convex, nonnegativity of the length of all 2-cycles is sufficient for the nonnegativity of the length of all k-cycles. In this article, it is shown that if each individual’s valuation type space is a full-dimensional convex product space and a mild domain regularity condition is satisfied, then (i) the nonnegativity of all 2-cycles implies that all k-cycles have zero length and (ii) all 2-cycles having zero length is necessary and sufficient for dominant strategy implementability.
Similar content being viewed by others
References
Archer A, Kleinberg R (2008) Truthful germs are contagious: a local to global characterization of truthfulness. In: Proceedings of the 9th ACM conference on electronic commerce (EC’08), Chicago, pp 21–30
Ashlagi I, Braverman M, Hassidim A, Monderer D (2010) Monotonicity and implementation. Econometrica 78: 1749–1772
Berger A, Müller R, Naeemi SH (2009) Characterizing incentive compatibility for convex valuations. In: Mavronicolas M, Papadopoulou VG (eds) Algorithmic game theory, vol. 5814 of Lecture notes in computer science. Springer-Verlag, Berlin, pp 24–35
Berger A, Müller R, Naeemi SH (2010) Path monotonicity and incentive compatibility. Research Memorandum No. RM/10/035, Maastricht Research School of Economics of Technology and Organization, Maastricht University, Maastricht
Bikhchandani S, Chatterji S, Lavi R, Mu’alem A, Nisan N, Sen A (2006) Weak monotonicity characterizes deterministic dominant-strategy implementation. Econometrica 74: 1109–1132
Carbajal JC, McLennan A, and Tourky R (2011) Truthful implementation and aggregation in restricted domains. Unpublished manuscript, School of Economics, University of Queensland
Gui H, Müller R, Vohra RV (2004) Characterizing dominant strategy mechanisms with multi-dimensional types. Discussion Paper No. 1392, Center for Mathematical Studies in Economics and Management Science, Northwestern University
Heydenreich B, Müller R, Uetz M, Vohra RV (2009) Characterization of revenue equivalence. Econometrica 77: 307–316
Jehiel P, Moldovanu B, Stacchetti E (1999) Multidimensional mechanism design for auctions with externalities. J Econ Theory 85: 258–293
Krishna V (2002) Auction Theory. Academic Press, San Diego
Lavi R, Mu’alem A, Nisan N (2009) Two simplified proofs for Roberts’ Theorem. Soc Choice Welf 32: 407–423
Mishra D (2009) Monotonicity and incentive compatibility. Unpublished manuscript, Planning Unit, Indian Statistical Institute, Delhi Centre
Mishra D, Sen A (2012) Roberts’ Theorem with neutrality: a social welfare ordering approach. Games and Economic Behavior (Forthcoming)
Myerson RB (1981) Optimal auction design. Math Operations Res 6: 58–73
Roberts K (1979) The characterization of implementatable choice rules. In: Laffont J-J (ed) Aggregation and revelation of preferences. North-Holland, Amsterdam, pp 321–348
Rochet J-C (1987) A necessary and sufficient condition for rationalizability in a quasi-linear context. J Math Econ 16: 191–200
Rockafellar RT (1970) Convex analysis. Princeton University Press, Princeton
Saks M, Yu L (2005) Weak monotonicity suffices for truthfulness on convex domains. In: Proceedings of the 6th ACM conference on electronic commerce (EC’05), Vancouver, pp 286–293
Vickrey W (1961) Counterspeculation, auctions, and competitive sealed tenders. J Finance 16: 8–37
Vohra RV (2011) Mechanism design: a linear programming approach. Cambridge University Press, Cambridge
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Cuff, K., Hong, S., Schwartz, J.A. et al. Dominant strategy implementation with a convex product space of valuations. Soc Choice Welf 39, 567–597 (2012). https://doi.org/10.1007/s00355-011-0604-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00355-011-0604-8