Market-based allocation with indivisible bids

Production and Operations Management

Volumn 16, Issue 4, 2007, Pages 495-509

  Schvartzman, L Julian ^a   Wellman, Michael P ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

AON auctions; Auction algorithms; Incremental multiple choice knapsack problem; Indivisible bids; Price quotes

Indexed keywords

EID: 34948822380     PISSN: 10591478     EISSN: None     Source Type: Journal    
DOI: 10.1111/j.1937-5956.2007.tb00275.x     Document Type: Article

References (19)

1. Bassamboo, A., M. Gupta, S. Juneja. 2001. Efficient winner determination techniques for Internet multi-unit auctions in First IFIP Conference on E-Commerce, E-Business, and E-Government. Kluwer, B. V., Zurich, pp. 417-430.
2. Cheng, J. Q., M. P. Wellman. 1998. The WALRAS algorithm: A convergent distributed implementation of general equilibrium outcomes. Computational Economics 12 1-24.
3. Cramton, P., Y. Shoham, R. Steinberg, editors. 2006. Combinatorial auctions. MIT Press.
4. Dudzinski, K., S. Walukiewicz. 1987. Exact method for the knapsack problem and its generalizations. European Journal of Operational Research 28 3-21.
5. Federal Communications Commission. 2000. Public Notice DA 002404 on auction no. 31. Available at http://wireless.fcc.gov/ auctions/31/releases/ da002404.pdf.
6. Horowitz, E., S. Sahni. 1974. Computing partitions and applications to the knapsack problem. Journal of the ACM 21 277-292.
7. Kalagnanam, J. R., A. J. Davenport, H. S. Lee. 2001. Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand. Electronic Commerce Research 1(3) 221-238.
8. Kellerer, H., U. Pferschy, D. Pisinger. 2004. Knapsack Problems. Springer Verlag.
9. Kelly, T. 2004. Generalized knapsack solvers for multi-unit combinatorial auctions. Analysis and application to computational resource allocation in AAMAS-04 Workshop on Agent-Mediated Electronic Commerce (AMEC-VI), New York.
10. Kothari, A., D. C. Parkes, S. Suri. 2003. Approximately-strategyproof and tractable multi-unit auctions in Fourth ACM Conference on Electronic Commerce, San Diego, California, pp. 166-175.
11. Lochner, K. M., M. P. Wellman. 2004. Rule-based specification of auction mechanisms. Third International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS-04), New York, pp. 818-825.
12. Lueker, G. S. 1998. Average-case analysis of off-line and on-line knapsack problems. Journal of Algorithms 29(2) 277-305.
13. Marchetti-Spaccamela, A., C. Vercellis. 1995. Stochastic on-line knapsack problems. Mathematical Programming 68(1) 73-104.
14. McMillan, J. 1994. Selling spectrum rights. Journal of Economic Perspectives 8(3), 145-162.
15. Miller, R. M. 2002. Paving Wall Street: Experimental Economics and the Quest for the Perfect Market. Wiley.
16. Nisan, N, 2000. Bidding and allocation in combinatorial auctions in Second ACM Conference on Electronic Commerce. Minneapolis, Minnesota, pp. 1-12.
17. van Hoesel, S., R. Müller. 2001. Optimization in electronic markets: Examples in combinatorial auctions. Netnomics 3 23-33.
18. Wurman, P. R., W. E. Walsh, M. P. Wellman. 1998. Flexible double auctions for electronic commerce: Theory and implementation. Decision Support Systems 24 17-27.
19. Ygge, F., H. Akkermans. 1999. Decentralized markets versus central control: A comparative study. Journal of Artificial Intelligence Research 11 301-333.