Market clearability

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2001, Pages 1145-1151

  Sandholm, Tuomas ^a   Suri, Subhash ^b  

^a Carnegie Mellon University   (United States)

^b University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION AREA; APPROXIMATION SCHEME; DISCRIMINATORY PRICING; ELECTRONIC MARKETPLACES; INHERENT COMPLEXITY; MARKET MECHANISMS; PIECEWISE LINEAR; PSEUDOPOLYNOMIAL ALGORITHMS;

ALGORITHMS; COMMERCE; MULTI AGENT SYSTEMS; PIECEWISE LINEAR TECHNIQUES; POLYNOMIAL APPROXIMATION;

COSTS;

EID: 84880914935     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. Yuzo Fujishima, Kevin Leyton-Brown, and Yoav Shoham. Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. In IJCAI, pages 548-553.
2. Michael R Garey and David S Johnson. Computers and Intractability. W. H. Freeman and Company.
3. E. L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston.
4. William A Lupien and John T Rickard. Crossing network utilizing optimal mutual satisfaction density profile. US Patent 5,689,652, granted Nov. 18 to Optimark Technologies.
5. Tuomas Sandholm and Subhash Suri. Improved algorithms for optimal winner determination in combinatorial auctions and generalizations. In AAAI, pages 90-97.
6. Tuomas Sandholm and Subhash Suri. Computational complexity of clearing exchanges. Technical report, 2001. In progress.
7. Tuomas Sandholm. An algorithm for optimal winner determination in combinatorial auctions. In IJCAI, pages 542-547. First appeared: Washington Univ., Dept. of Computer Science WUCS-99-01, Jan. 28th.
8. Tuomas Sandholm. eMediator: A next generation electronic commerce server. In AGENTS, pages 73-96, Barcelona, Spain, June 2000.
9. Early version: AAAI-99 Workshop on AI in Electronic Commerce, pp. 46-55, July 1999, and Washington Univ., St. Louis, Dept. of Computer Science WU-CS-99-02, Jan. 1999.
10. Moshe Tennenholtz. Some tractable combinatorial auctions. AAAI.
11. Peter R Wurman, Michael P Wellman, and William E Walsh. The Michigan Internet AuctionBot: A configurable auction server for human and software agents. In AGENTS, pages 301-308.