Searching for the Possibility Impossibility Border of Truthful Mechanism Design RON LAVI Faculty of Industrial Engineering and Management, The Technion, Israel One of the rst results to merge auction theory and algorithmic theory, [Lehmann et al. 2002], considers a combinatorial auction setting, and describes a computationally e cient and truthful auction for single-minded players, i.e. players that desire only one speci c subset of items. The natural continuation would have been the case of multi-minded players. Indeed, the literature has managed to extend the results to the more general cases, by using randomness (e.g. [Lavi and Swamy 2005; Dobzinski et al. 2006]). However, in the deterministic case, virtually no positive advancement was made ever since.1 An even worse state of a airs exists in the algorithmic domain of job scheduling. The seminal paper on algorithmic mechanism design [Nisan and Ronen 2001] describes a basic impossibility for the multi-dimensional version of the problem, while [Archer and Tardos 2001] observe the possibility in the single-dimensional case. Here, the situation is even worse, as the transition from the possibility to the impossibility does not depend on any computational assumptions, and since we do not even know if randomness can
End of preview. The entire article is 5 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/searching-for-the-possibility-impossibility-border-of-truthful-oINp0ccGa4
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Searching for the possibility: impossibility border of truthful mechanism design
Lavi, Ron
Follow ACM SIGecom Exchanges
, Volume 7 (1)
Association for Computing Machinery – Dec 1, 2007
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
