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
  Goldberg, Andrew V. Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 2 of 2 reviews    
  Derandomization of auctions
Aggarwal G., Fiat A., Goldberg A., Hartline J., Immorlica N., Sudan M.  Theory of computing (Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, Baltimore, MD, May 22-24, 2005) 619-625, 2005.  Type: Proceedings

In a single-round, sealed-bid auction, every bidder, independently, submits a single bid without seeing the bids of others. One talks about unlimited supply, unit-demand auctions when an infinite number of items is for sale, and every ...
...
Jul 31 2006  
  Beyond the flow decomposition barrier
Goldberg A., Rao S. Journal of the ACM 45(5): 783-797, 1998.  Type: Article

It is always a pleasure to see a breakthrough on an old problem, particularly one that I thought had been resolved. The problem here is to find the maximal flow through a network with n vertices and m...
Aug 1 1999  

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