메뉴 건너뛰기




Volumn 6230 LNAI, Issue , 2010, Pages 510-522

An adaptive bidding strategy for combinatorial auction-based resource allocation in dynamic markets

Author keywords

[No Author keywords available]

Indexed keywords

BIDDING STRATEGY; COMBINATORIAL AUCTION; DYNAMIC MARKET; PRIOR KNOWLEDGE; PROFIT MARGIN; RESOURCE ALLOCATION PROBLEM; WINNER DETERMINATION PROBLEM;

EID: 78049264421     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15246-7_47     Document Type: Conference Paper
Times cited : (2)

References (16)
  • 1
    • 34249667039 scopus 로고    scopus 로고
    • Bidding strategies and their impact on revenues in combinatorial auctions
    • An, N., Elmaghraby, W., Keskinocak, P.: Bidding strategies and their impact on revenues in combinatorial auctions. J. Rev. Pricing Manage. 3(4), 337-357 (2005)
    • (2005) J. Rev. Pricing Manage , vol.3 , Issue.4 , pp. 337-357
    • An, N.1    Elmaghraby, W.2    Keskinocak, P.3
  • 4
    • 0242550401 scopus 로고    scopus 로고
    • Combinatorial auctions: A survey
    • DOI 10.1287/ijoc.15.3.284.16077
    • de Vries, S., Vohra, R.: Combinatorial Auctions: A Survey. INFORMS. J. Comput. 15(3), 284-309 (2003) (Pubitemid 39042722)
    • (2003) INFORMS Journal on Computing , vol.15 , Issue.3 , pp. 284-309
    • De Vries, S.1    Vohra, R.V.2
  • 5
    • 84937404136 scopus 로고    scopus 로고
    • The anatomy of the grid: Enabling scalable virtual organizations
    • Euro-Par 2001 Parallel Processing
    • Foster, I.: The Anatomy of the Grid: Enabling Scalable Virtual Organizations. In: Sakellariou, R., Keane, J. A., Gurd, J. R., Freeman, L. (eds.) Euro-Par 2001. LNCS, vol. 2150, p. 1. Springer, Heidelberg (2001) (Pubitemid 33326514)
    • (2001) Lecture Notes in Computer Science , Issue.2150 , pp. 1-4
    • Foster, I.1
  • 6
    • 84880681390 scopus 로고    scopus 로고
    • Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches
    • Fujishima, Y., Leyton-Brown, K., Shoham, Y.: Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. In: IJCAI, pp. 548-553 (1999)
    • (1999) IJCAI , pp. 548-553
    • Fujishima, Y.1    Leyton-Brown, K.2    Shoham, Y.3
  • 7
    • 1142280954 scopus 로고    scopus 로고
    • Resource allocation games with changing resource capacities
    • Galstyan, A., Kolar, S., Lerman, K.: Resource allocation games with changing resource capacities. In: AAMAS, pp. 145-152 (2003)
    • (2003) AAMAS , pp. 145-152
    • Galstyan, A.1    Kolar, S.2    Lerman, K.3
  • 8
    • 84902292277 scopus 로고    scopus 로고
    • Iterative combinatorial auctions: Theory and practice
    • Parkes, D., Ungar, L.: Iterative combinatorial auctions: Theory and practice. In: AAAI, pp. 74-81 (2000)
    • (2000) AAAI , pp. 74-81
    • Parkes, D.1    Ungar, L.2
  • 9
    • 0000594032 scopus 로고
    • A combinatorial auction mechanism for airport time slot allocation
    • Rassenti, S., Smith, V., Bulfin, R.: A combinatorial auction mechanism for airport time slot allocation. Be. J. of Econ. 13(2), 402-417 (1982)
    • (1982) Be. J. of Econ. , vol.13 , Issue.2 , pp. 402-417
    • Rassenti, S.1    Smith, V.2    Bulfin, R.3
  • 10
    • 0032141895 scopus 로고    scopus 로고
    • Computationally manageable combinational auctions
    • Rothkopf, M., Pekec, A., Harstad, R.: Computationally Manageable Combinational Auctions. Manage. Sci. 44(8), 1131-1147 (1998) (Pubitemid 128569657)
    • (1998) Management Science , vol.44 , Issue.8 , pp. 1131-1147
    • Rothkopf, M.H.1    Pekec, A.2    Harstad, R.M.3
  • 11
    • 0027708201 scopus 로고
    • An implementation of the contract net protocol based on marginal cost calculations
    • Sandholm, T.: An implementation of the contract net protocol based on marginal cost calculations. In: AAAI, pp. 256-262 (1993)
    • (1993) AAAI , pp. 256-262
    • Sandholm, T.1
  • 12
    • 18144420825 scopus 로고    scopus 로고
    • CABOB: A fast optimal algorithm for winner determination in combinatorial auctions
    • DOI 10.1287/mnsc.1040.0336, Electronic Markets
    • Sandholm, T., Suri, S., Gilpin, A., Levine, D.: CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions. Manage. Sci. 51(3), 374-390 (2005) (Pubitemid 40611817)
    • (2005) Management Science , vol.51 , Issue.3 , pp. 374-390
    • Sandholm, T.1    Suri, S.2    Gilpin, A.3    Levine, D.4
  • 13
    • 78049266177 scopus 로고    scopus 로고
    • Towards self-organising agent-based resource allocation in a multi-server environment
    • ACM, New York
    • Schlegel, T., Kowalczyk, R.: Towards self-organising agent-based resource allocation in a multi-server environment. In: AAMAS, pp. 1-8. ACM, New York (2007)
    • (2007) AAMAS , pp. 1-8
    • Schlegel, T.1    Kowalczyk, R.2
  • 15
    • 57649223879 scopus 로고    scopus 로고
    • An adaptive bidding strategy in multi-round combinatorial auctions for resource allocation
    • IEEE Computer Society, Los Alamitos
    • Sui, X., Leung, H. F.: An Adaptive Bidding Strategy in Multi-Round Combinatorial Auctions for Resource Allocation. In: ICTAI. IEEE Computer Society, Los Alamitos (2008)
    • (2008) ICTAI
    • Sui, X.1    Leung, H.F.2
  • 16
    • 0242708862 scopus 로고    scopus 로고
    • An efficient approximate allocation algorithm for combinatorial auctions
    • Zurel, E., Nisan, N.: An efficient approximate allocation algorithm for combinatorial auctions. In: ACM EC, pp. 125-136 (2001)
    • (2001) ACM EC , pp. 125-136
    • Zurel, E.1    Nisan, N.2


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