메뉴 건너뛰기




Volumn , Issue , 2001, Pages 115-124

Bidding algorithms for simultaneous auctions

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; INTELLIGENT AGENTS; OPTIMAL SYSTEMS; RESOURCE ALLOCATION; SOFTWARE AGENTS;

EID: 0001509483     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/501158.501171     Document Type: Conference Paper
Times cited : (24)

References (12)
  • 2
    • 0031275421 scopus 로고    scopus 로고
    • Zero is not enough: On the lower limit of agent intelligence for continuous double auction markets
    • HP Technical Report HPL-97-141
    • D. Cliff and J. Bruten. Zero is not enough: On the lower limit of agent intelligence for continuous double auction markets. HP Technical Report HPL-97-141, 1997.
    • (1997)
    • Cliff, D.1    Bruten, J.2
  • 4
    • 85040831051 scopus 로고    scopus 로고
    • Optimal solutions for multi-unit combinatorial auctions: Branch and bound heuristics
    • October
    • R. Gonen and D. Lehmann. Optimal solutions for multi-unit combinatorial auctions: Branch and bound heuristics. In Proceedings of Second ACM Conference on Electronic Commerce, pages 13-29, October 2000.
    • (2000) Proceedings of Second ACM Conference on Electronic Commerce , pp. 13-29
    • Gonen, R.1    Lehmann, D.2
  • 5
    • 4243279181 scopus 로고    scopus 로고
    • Bid determination in simultaneous auctions
    • A. Greenwald, J. Boyan, R. M. Kirby, and J. Reiter. Bid determination in simultaneous auctions. http://www.cs.brown.edu/people/amygreen/, 2001.
    • (2001)
    • Greenwald, A.1    Boyan, J.2    Kirby, R.M.3    Reiter, J.4
  • 6
    • 0035273388 scopus 로고    scopus 로고
    • Autonomous bidding agents in the trading agent competition
    • April
    • A. Greenwald and P. Stone. Autonomous bidding agents in the Trading Agent Competition. IEEE Internet Computing, April 2001.
    • (2001) IEEE Internet Computing
    • Greenwald, A.1    Stone, P.2
  • 9
    • 84978059461 scopus 로고    scopus 로고
    • Improved algorithms for optimal winner determination in combinatorial auctions and generalizations
    • T. Sandholm and S. Suri. Improved algorithms for optimal winner determination in combinatorial auctions and generalizations. In Proceedings of AAAI, pages 90-97, 2000.
    • (2000) Proceedings of AAAI , pp. 90-97
    • Sandholm, T.1    Suri, S.2
  • 11
    • 84898992015 scopus 로고    scopus 로고
    • On-line policy improvement using Monte-Carlo search
    • In M. C. Mozer, M. I. Jordan, and T. Petsche, editors; MIT Press
    • G. Tesauro and G. R. Galperin. On-line policy improvement using Monte-Carlo search. In M. C. Mozer, M. I. Jordan, and T. Petsche, editors, Advances in NIPS, volume 9. MIT Press, 1997.
    • (1997) Advances in NIPS , vol.9
    • Tesauro, G.1    Galperin, G.R.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.