ACM Home Page
Please provide us with feedback. Feedback
Monotonicity and implementability: extended abstract
Full text PdfPdf (117 KB)
Source
Electronic Commerce archive
Proceedings of the 9th ACM conference on Electronic commerce table of contents
Chicago, Il, USA
SESSION: Characterizing incentive compatibility table of contents
Pages 48-48  
Year of Publication: 2008
ISBN:978-1-60558-169-9
Author
Dov Monderer  Technion, Haifa, Israel
Sponsors
ACM: Association for Computing Machinery
SIGEcom: ACM Special Interest Group on Electronic Commerce
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 59,   Citation Count: 1
Additional Information:

abstract   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1386790.1386799
What is a DOI?

ABSTRACT

Consider a model with finite number of goods, and with buyers with private values and quasi-linear utility functions. A domain of valuation functions for a buyer is a monotonicity domain if every finite-valued monotone randomized allocation rule defined on it is implementable, in the sense that there exists a randomized truth-telling direct mechanism that implements this allocation rule. We prove that a domain of valuations of dimension at least 2 is a monotonicity domain if and only if its closure is convex.