Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Conitzer, Vincent Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 3 of 3 reviews    
  General tiebreaking schemes for computational social choice
Freeman R., Brill M., Conitzer V.  AAMAS 2015 (Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, Istanbul, Turkey, May 4-8, 2015) 1401-1409, 2015.  Type: Proceedings

Tiebreaking is a natural issue in social choice and in computational social choice. However, with the passing of time, it has become more and more clear that tiebreaking is a quite important and subtle issue, and that in some cases one...
...
May 23 2016  
  Computing optimal outcomes under an expressive representation of settings with externalities
Conitzer V., Sandholm T. Journal of Computer and System Sciences 78(1): 2-14, 2012.  Type: Article

Computing optimal allocations is a ubiquitous and notoriously hard computational problem that is significant in settings such as combinatorial auctions. This paper considers an expressive representation of such settings in which agents...
...
Apr 19 2012  
  A qualitative Vickrey auction
Harrenstein B., de Weerdt M., Conitzer V.  EC 2009 (Proceedings of the 10th ACM Conference on Electronic Commerce, Stanford, CA, Jul 6-10, 2009) 197-206, 2009.  Type: Proceedings

This paper provides a theoretic foundation for deciding what bid to choose among a collection of bids, in order to perform tasks or services, by setting conditions for auctions. Specifically, this paper gives two settings in which a qu...
...
Oct 30 2009  

   
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy