메뉴 건너뛰기




Volumn 258, Issue , 2007, Pages 25-34

A comparison of distributed and centralised agent based bundling systems

Author keywords

Allocation; Combinatorial auctions; Distributed market performance; Grid; Quote driven market; Resource; Trading agents

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTER NETWORKS; ECONOMIC ANALYSIS; MARKETING; OPTIMIZATION;

EID: 36849034424     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1282100.1282108     Document Type: Conference Paper
Times cited : (3)

References (22)
  • 1
    • 0029531502 scopus 로고
    • Nimrod: A tool for performing parameterised simulations using distributed workstations
    • David Abramson, Rok Sosie, J. Giddy, and B. Hall. Nimrod: A tool for performing parameterised simulations using distributed workstations. In HPDC, pages 112-121, 1995.
    • (1995) HPDC , pp. 112-121
    • Abramson, D.1    Sosie, R.2    Giddy, J.3    Hall, B.4
  • 2
    • 36849012600 scopus 로고    scopus 로고
    • Rachel A. Bourne, John Bigham, and Stefan Poslad. Effect of market type in continuous environments: The need for intermediaries
    • Rachel A. Bourne, John Bigham, and Stefan Poslad. Effect of market type in continuous environments: The need for intermediaries.
  • 3
    • 1142268202 scopus 로고    scopus 로고
    • Optimal clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with demand/supply function bidding
    • ACM Press
    • Viet Dung Dang and Nicholas R. Jennings. Optimal clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with demand/supply function bidding. In ICEC "03: Proceedings of the 5th international conference on Electronic commerce, pages 25-30. ACM Press, 2003.
    • (2003) ICEC 03: Proceedings of the 5th international conference on Electronic commerce , pp. 25-30
    • Dung Dang, V.1    Jennings, N.R.2
  • 5
    • 85005991825 scopus 로고    scopus 로고
    • Markets vs auctions: Approaches to distributed combinatorial resource scheduling
    • P Gradwell and J Padget. Markets vs auctions: Approaches to distributed combinatorial resource scheduling. In Multiagent and Grid Systems, pages 251-262, 2005.
    • (2005) Multiagent and Grid Systems , pp. 251-262
    • Gradwell, P.1    Padget, J.2
  • 6
    • 0242466945 scopus 로고    scopus 로고
    • Southamptontac: Designing a successful trading agent
    • Minghua He and Nicholas R. Jennings. Southamptontac: Designing a successful trading agent. In ECAI, pages 8-12, 2002.
    • (2002) ECAI , pp. 8-12
    • He, M.1    Jennings, N.R.2
  • 7
    • 0024664926 scopus 로고
    • A microeconomic approach to optimal resource allocation in distributed computer systems
    • James F Kurose and Rahul Simha. A microeconomic approach to optimal resource allocation in distributed computer systems. In IEEE Transactions On Computers Vol 38, pages 705-716, 1989.
    • (1989) IEEE Transactions On Computers , vol.38 , pp. 705-716
    • Kurose, J.F.1    Simha, R.2
  • 9
    • 9444236606 scopus 로고    scopus 로고
    • Learning the empirical hardness of optimization problems: The case of combinatorial auctions
    • K. Leyton-Brown, E. Nudelman, and Y. Shoham. Learning the empirical hardness of optimization problems: The case of combinatorial auctions. In Constraint Programming (CP), 2002.
    • (2002) Constraint Programming (CP)
    • Leyton-Brown, K.1    Nudelman, E.2    Shoham, Y.3
  • 12
    • 36849000403 scopus 로고    scopus 로고
    • Tim Finin et. al. Li Ding. Strategies and Heuristics Used by the UMBCTAC Agent
    • Tim Finin et. al. Li Ding. Strategies and Heuristics Used by the UMBCTAC Agent.
  • 13
    • 33745204609 scopus 로고    scopus 로고
    • Experiences creating three implementations of the repast agent modeling toolkit
    • Michael J. North, Nicholson T. Collier, and Jerry R. Vos. Experiences creating three implementations of the repast agent modeling toolkit. ACM Trans. Model. Comput. Simul., 16(1):1-25, 2006.
    • (2006) ACM Trans. Model. Comput. Simul , vol.16 , Issue.1 , pp. 1-25
    • North, M.J.1    Collier, N.T.2    Vos, J.R.3
  • 14
    • 36849080417 scopus 로고    scopus 로고
    • Computational mechanism design - taming the strategic dragon without invoking the complexity monster
    • David Parkes. Computational mechanism design - taming the strategic dragon without invoking the complexity monster. Talk given at AAMAS03.
    • Talk given at AAMAS03
    • Parkes, D.1
  • 16
    • 33144465962 scopus 로고    scopus 로고
    • Optimal winner determination algorithms
    • Peter Cramton, Yoav Shoham, and Richard Steinberg, editors, chapter 14. MIT Press
    • T Sandholm. Optimal winner determination algorithms. In Peter Cramton, Yoav Shoham, and Richard Steinberg, editors, Combinatorial Auctions, chapter 14. MIT Press, 2005.
    • (2005) Combinatorial Auctions
    • Sandholm, T.1
  • 17
    • 0036467861 scopus 로고    scopus 로고
    • Algorithm for optimal winner determination in combinatorial auctions
    • Tuomas Sandholm. Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence, 135(1-2): 1-54, 2002.
    • (2002) Artificial Intelligence , vol.135 , Issue.1-2 , pp. 1-54
    • Sandholm, T.1
  • 19
    • 0019045531 scopus 로고
    • Resource management for large systems: Concepts, algorithms, and an application
    • Rajan Suri and Yu-Chi Ho. Resource management for large systems: Concepts, algorithms, and an application. In IEEE Transactions On Automatic Control Vol 4, pages 651-662, 1980.
    • (1980) IEEE Transactions On Automatic Control , vol.4 , pp. 651-662
    • Suri, R.1    Ho, Y.2
  • 20
    • 36849030854 scopus 로고    scopus 로고
    • et al. Torsten Eymann. Catallaxy-based grid markets
    • et al. Torsten Eymann. Catallaxy-based grid markets.


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