Dominant strategy implementation with a convex product space of valuations
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.
Unable to display preview. Download preview PDF.
- 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–30Google Scholar
- 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–35Google Scholar
- 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, MaastrichtGoogle Scholar
- Carbajal JC, McLennan A, and Tourky R (2011) Truthful implementation and aggregation in restricted domains. Unpublished manuscript, School of Economics, University of QueenslandGoogle Scholar
- 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 UniversityGoogle Scholar
- Krishna V (2002) Auction Theory. Academic Press, San DiegoGoogle Scholar
- Mishra D (2009) Monotonicity and incentive compatibility. Unpublished manuscript, Planning Unit, Indian Statistical Institute, Delhi CentreGoogle Scholar
- Mishra D, Sen A (2012) Roberts’ Theorem with neutrality: a social welfare ordering approach. Games and Economic Behavior (Forthcoming)Google Scholar
- Roberts K (1979) The characterization of implementatable choice rules. In: Laffont J-J (ed) Aggregation and revelation of preferences. North-Holland, Amsterdam, pp 321–348Google Scholar
- Rockafellar RT (1970) Convex analysis. Princeton University Press, PrincetonGoogle Scholar
- 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–293Google Scholar
- Vickrey W (1961) Counterspeculation, auctions, and competitive sealed tenders. J Finance 16: 8–37Google Scholar
- Vohra RV (2011) Mechanism design: a linear programming approach. Cambridge University Press, CambridgeGoogle Scholar