메뉴 건너뛰기




Volumn 2, Issue 2 SPEC., 2003, Pages 176-186

Reducing complexity in winner determination for combinatorial ascending auctions

Author keywords

Combinatorial auctions; Computational complexity; E marketplace

Indexed keywords

ALGORITHMS; INTERNET; MARKETING; SOFTWARE AGENTS;

EID: 0038373222     PISSN: 15674223     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1567-4223(03)00013-9     Document Type: Article
Times cited : (8)

References (23)
  • 3
    • 21444435260 scopus 로고    scopus 로고
    • A binary conflict ascending price (BICAP) mechanism for the decentralized allocation of the right to use railroad tracks
    • Brewer P.J., Plott C.R. A binary conflict ascending price (BICAP) mechanism for the decentralized allocation of the right to use railroad tracks. International Journal of Industrial Organization. 14:1996;857-886.
    • (1996) International Journal of Industrial Organization , vol.14 , pp. 857-886
    • Brewer, P.J.1    Plott, C.R.2
  • 5
    • 84880681390 scopus 로고    scopus 로고
    • Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches
    • Fujishjima Y., Leyton-Brown K., Shoham Y. Taming the computational complexity of combinatorial auctions: optimal and approximate approaches. Proceedings of IJCAI: 1999.
    • (1999) Proceedings of IJCAI
    • Fujishjima, Y.1    Leyton-Brown, K.2    Shoham, Y.3
  • 7
    • 0032804976 scopus 로고    scopus 로고
    • Auction theory: A guide to the literature
    • Klemperer P. Auction theory: a guide to the literature. Journal of Economic Surveys. 13:(3):1999;227-284.
    • (1999) Journal of Economic Surveys , vol.13 , Issue.3 , pp. 227-284
    • Klemperer, P.1
  • 8
    • 0022129301 scopus 로고
    • Depth-first iterative-deepening: An optimal admissible tree search
    • Korf R. Depth-first iterative-deepening: an optimal admissible tree search. Artificial Intelligence. 27:(1):1985;97-109.
    • (1985) Artificial Intelligence , vol.27 , Issue.1 , pp. 97-109
    • Korf, R.1
  • 13
    • 0000594032 scopus 로고
    • A combinatorial auction mechanism for airport time slot allocation
    • Rassenti S.J., Smith V.L., Bulfin R.L. A combinatorial auction mechanism for airport time slot allocation. Bell Journal of Economics. 13:1982;402-417.
    • (1982) Bell Journal of Economics , vol.13 , pp. 402-417
    • Rassenti, S.J.1    Smith, V.L.2    Bulfin, R.L.3
  • 14
    • 0032141895 scopus 로고    scopus 로고
    • Computationally manageable combinatorial auctions
    • Rothkopf M.H., Pekec A., Harstad R.M. Computationally manageable combinatorial auctions. Management Science. 44:(8):1998;1131-1147.
    • (1998) Management Science , vol.44 , Issue.8 , pp. 1131-1147
    • Rothkopf, M.H.1    Pekec, A.2    Harstad, R.M.3
  • 17
    • 84880653860 scopus 로고    scopus 로고
    • An algorithm for optimal winner determination in combinatorial auctions
    • Sandholm T. An algorithm for optimal winner determination in combinatorial auctions. Proceedings of IJCAI:1999.
    • (1999) Proceedings of IJCAI
    • Sandholm, T.1
  • 19
    • 84980096808 scopus 로고
    • Counterspeculation, auctions and competitive sealed tenders
    • Vickrey W. Counterspeculation, auctions and competitive sealed tenders. Journal of Finance. 16:1961;8-37.
    • (1961) Journal of Finance , vol.16 , pp. 8-37
    • Vickrey, W.1
  • 22
    • 0043202761 scopus 로고    scopus 로고
    • World Wide Web Consortium, Web Services Activity, http://www.w3.org/2002/ws/.
    • Web Services Activity


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