Computing price trajectories in combinatorial auctions with proxy bidding

Electronic Commerce Research and Applications

Volumn 3, Issue 4, 2004, Pages 329-340

  Wurman, Peter R ^a   Zhong, Jie ^a   Cai, Gangshu ^a  

^a North Carolina State University   (United States)

Author keywords

Auction algorithms; Combinatorial auctions; Proxy bidding

Indexed keywords

ALGORITHMS; COMPUTER PROGRAM LISTINGS; COMPUTER SIMULATION; PROBLEM SOLVING; PUBLIC POLICY; SET THEORY;

AUCTION ALGORITHMS; COMBINATORIAL AUCTIONS; PROXY AUCTION PROBLEM (PAP); PROXY BINDING;

ELECTRONIC COMMERCE;

EID: 8344224395     PISSN: 15674223     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.elerap.2004.06.003     Document Type: Conference Paper

References (16)

1. A. Andersson, M. Tenhunen, F. Ygge, Integer programming for combinatorial auction winner determination, in: Fourth International Conference on Multiagent Systems, pp. 39-46, 2000.
2. L.M. Ausubel, P.R. Milgrom, Ascending auctions with package bidding, Frontiers of Theoretical Economics 1 (1) (2002) 1-42.
3. Y. Fujishima, K. Leyton-Brown, Y. Shoham, Taming the computational complexity of combinatorial auctions: optimal and approximate approaches, in: Sixteenth International Joint Conference on Artificial Intelligence, pp. 548-553, 1999.
4. K. Hoffman, D. Menon, T. Wilson, Observations and near-direct implementations of the ascending proxy auction, December 2003.
5. R. Kastner, C. Hsieh, M. Potkonjak, M. Sarrafzadeh, On the sensitivity of incremental algorithms for combinatorial auctions, in: IEEE International Workshop on Advanced Issues of E-Commerce & Web-Based Information Systems (WECWIS), 2002.
6. P. Milgrom, Putting auction theory to work: the simultaneous ascending auction, Journal of Political Economy 108 (2) (2000) 245-272.
7. N. Nisan, Bidding and allocation in combinatorial auctions, in: Second ACM Conference on Electronic Commerce, pp. 1-12, 2000.
8. D.C. Parkes, iBundle: An efficient ascending price bundle auction. First ACM Conference on Electronic Commerce, 148-157, November 1999.
9. D.C. Parkes, Iterative combinatorial auctions, in: P. Crampton, Y. Shoham, R. Steinberg, (Eds.), Combinatorial Auctions, to appear, 2003.
10. D.C. Parkes, L.H. Ungar, Preventing strategic manipulation in iterative auctions: Proxy agents and price-adjustment, in: Seventeenth National Conference on Artificial Intelligence, pp. 82-89, 2000.
11. J. Rodriguez, P. Noriega, C. Sierra, J. Padget, FM96.5 a Java-based electronic auction house, in: Second International Conference on the Practical Application of Intelligent Agents and Multi-Agent Technology (PAAM '97), 1997.
12. A.E. Roth, A. Ockenfels, Last-minute bidding and the rules for ending second-price auctions: Evidence from eBay and Amazon auctions on the Internet, American Economic Review 92 (4) (2002) 1093-1103.
13. T. Sandholm, S. Suri, A. Gilpin, D. Levine, Cabob: a fast optimal algorithm for combinatorial auctions, in: International Joint Conference on Artificial Intelligence, Seattle, WA, 2001.
14. P.R. Wurman, G. Cai, J. Zhong, A. Sureka, An algorithm for computing the outcome of combinatorial auctions with proxy bidding, in: Fifth International Conference on Electronic Commerce, pp. 1-8, Pittsburgh, PA, 2003.
15. P.R. Wurman, M.P. Wellman. AkBA: a progressive, anonymous-price combinatorial auction, in: Second ACM Conference on Electronic Commerce, pp. 21-29, 2000.
16. P.R. Wurman, M.P. Wellman, W.E. Walsh, A parametrization of the auction design space, Games and Economic Behavior 35 (1-2) (2001) 304-338.