Publication View

[Computers and Society]: Electronic Commerce—payment (2008)

Abstract
Weak monotonicity is a simple necessary condition for a social choice function to be implementable by a truthful mechanism. Roberts [10] showed that it is sufficient for all social choice functions whose domain is unrestricted. Lavi, Mu’alem and Nisan [6] proved the sufficiency of weak monotonicity for functions over order-based domains and Gui, Muller and Vohra [5] proved sufficiency for order-based domains with range constraints and for domains defined by other special types of linear inequality constraints. Here we show the more general result,conjectured by Lavi,Mu’alem and Nisan [6],that weak monotonicity is sufficient for functions defined on any convex domain.

Publication details
Download http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.2467
Source http://www.cs.cmu.edu/~sandholm/cs15-892F07/p286-saks.pdf
Contributors CiteSeerX
Repository CiteSeerX - Scientific Literature Digital Library and Search Engine (United States)
Keywords mechanism design, strategyproof, truthful, weak
Type text
Language English
Relation 10.1.1.132.4006, 10.1.1.109.3231, 10.1.1.100.7364, 10.1.1.108.6357, 10.1.1.83.360