Tractable combinatorial auctions and b-matching

Artificial Intelligence

Volumn 140, Issue 1-2, 2002, Pages 231-243

  Tennenholtz, Moshe ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

B matching; Combinatorial auctions; Electronic commerce

Indexed keywords

COMPUTATIONAL COMPLEXITY; ELECTRONIC COMMERCE; HEURISTIC METHODS; INTERNET; OPTIMIZATION; POLYNOMIALS;

COMBINATORIAL AUCTIONS;

ARTIFICIAL INTELLIGENCE;

EID: 0036724444     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(02)00229-1     Document Type: Article

References (17)

1. A polynomial algorithm for b-matchings: An alternative approach
2. What your computer really needs to know, you learned in kindergarten
3. Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches
4. Negotiation and cooperation in multi-agent environments
5. Truth revelation in rapid, approximately efficient combinatorial auctions
6. Optimal auctions revisited
7. Bidding and allocation in combinatorial auctions
8. Ibundle: An efficient ascending price bundle auction
9. Constrained multi-object auctions and b-matching
10. Computationally manageable combinatorial auctions
11. Limitations of the vickrey auction in computational multiagent systems
12. An algorithm for optimal winner determination in combinatorial auctions
13. Electronic commerce: From game-theoretic and economic models to working protocols
14. Auction protocols for decentralized scheduling