메뉴 건너뛰기




Volumn 163, Issue 2, 2005, Pages 503-529

Design for optimized multi-lateral multi-commodity markets

Author keywords

Market design; Multi round auctions; Optimized multi lateral multi commodity markets

Indexed keywords

COSTS; INTERNET; MARKETING; OPERATIONS RESEARCH; OPTIMIZATION; RESOURCE ALLOCATION; SALES;

EID: 10044220874     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2003.07.022     Document Type: Article
Times cited : (10)

References (22)
  • 2
    • 0003489924 scopus 로고    scopus 로고
    • Demand reduction and inefficiency in multi-unit auction
    • University of Maryland
    • Ausubel, L.M., Cramton, P., 1996. Demand reduction and inefficiency in multi-unit auction. Working paper, University of Maryland.
    • (1996) Working Paper
    • Ausubel, L.M.1    Cramton, P.2
  • 4
    • 21444435260 scopus 로고    scopus 로고
    • A binary conflict ascending price (BICAP) mechanism for the decentralized allocation of the right to use railroads tracks
    • Brewer, P.J., Plott, C.R., 1996. A binary conflict ascending price (BICAP) mechanism for the decentralized allocation of the right to use railroads tracks. International Journal of Industrial Organization 14, 857-886.
    • (1996) International Journal of Industrial Organization , vol.14 , pp. 857-886
    • Brewer, P.J.1    Plott, C.R.2
  • 8
    • 0344210369 scopus 로고    scopus 로고
    • A web-based financial trading system
    • Fan, M., Stallaert, J., Whinston, A.B., 1999. A web-based financial trading system. IEEE Computer 32 (4), 64-70.
    • (1999) IEEE Computer , vol.32 , Issue.4 , pp. 64-70
    • Fan, M.1    Stallaert, J.2    Whinston, A.B.3
  • 10
    • 35248821395 scopus 로고    scopus 로고
    • Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand
    • Kalagnanam, J.R., Davenport, A.J., Lee, H.S., 2001. Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand. Electronic Commerce Research 1 (3), 221-238.
    • (2001) Electronic Commerce Research , vol.1 , Issue.3 , pp. 221-238
    • Kalagnanam, J.R.1    Davenport, A.J.2    Lee, H.S.3
  • 11
    • 0010912764 scopus 로고
    • Using computerized exchange systems to solve an allocation problem in project management
    • Ledyard, J.O., Porter, D., Rangel, A., 1994. Using computerized exchange systems to solve an allocation problem in project management. Journal of Organizational Computing 4 (3), 271-296.
    • (1994) Journal of Organizational Computing , vol.4 , Issue.3 , pp. 271-296
    • Ledyard, J.O.1    Porter, D.2    Rangel, A.3
  • 12
    • 0003696162 scopus 로고    scopus 로고
    • A smart market for resource reservation in a multiple quality of service information network
    • University of Michigan
    • MacKie-Mason, J.K., 1997. A smart market for resource reservation in a multiple quality of service information network. Technical report, University of Michigan.
    • (1997) Technical Report
    • MacKie-Mason, J.K.1
  • 14
    • 10044251713 scopus 로고    scopus 로고
    • The use of computer-assisted auctions for allocating tradable pollution permits
    • Clearwater, S. (Ed.), World Scientific Pub. Co, New York
    • Marron, D.B., Bartels, C.W., 1996. The use of computer-assisted auctions for allocating tradable pollution permits. In: Clearwater, S. (Ed.), Market-Based Control: A Paradigm for Distributed Resource Allocation. World Scientific Pub. Co, New York.
    • (1996) Market-based Control: A Paradigm for Distributed Resource Allocation
    • Marron, D.B.1    Bartels, C.W.2
  • 15
    • 0030162538 scopus 로고    scopus 로고
    • Smart market mechanisms: From practice to theory
    • Miller, R., 1996. Smart market mechanisms: From practice to theory. Journal of Economic Dynamics and Control 20, 967-978.
    • (1996) Journal of Economic Dynamics and Control , vol.20 , pp. 967-978
    • Miller, R.1
  • 17
    • 0000594032 scopus 로고
    • A combinatorial auction mechanism for airport time slot allocation
    • Rassenti, S.J., Smith, V.L., Bulfin, R.L., 1982. A combinatorial auction mechanism for airport time slot allocation. Bell Journal of Economics 13 (2), 402-417.
    • (1982) Bell Journal of Economics , vol.13 , Issue.2 , pp. 402-417
    • Rassenti, S.J.1    Smith, V.L.2    Bulfin, R.L.3
  • 18
    • 0043039065 scopus 로고
    • Designing purpa power purchase auctions: Theory and practice
    • Plummer, J., Troppmann, S. (Eds.), Competition in Electricity: New Markets and New Structures, Inc, Arlington, VA
    • Rothkopf, M.H., Kahn, E.P., Teisberg, T.J., Eto, J., Nataf, J.-M., 1990. Designing purpa power purchase auctions: Theory and practice. In: Plummer, J., Troppmann, S. (Eds.), Competition in Electricity: New Markets and New Structures. Public Utilities Reports, Inc, Arlington, VA, pp. 139-194.
    • (1990) Public Utilities Reports , pp. 139-194
    • Rothkopf, M.H.1    Kahn, E.P.2    Teisberg, T.J.3    Eto, J.4    Nataf, J.-M.5
  • 19
    • 0032141895 scopus 로고    scopus 로고
    • Computationally manageable combinatorial auctions
    • Rothkopf, M.H., Pekec, A., Harstad, R.M., 1998. Computationally manageable combinatorial auctions. Management Science 44, 1131-1147.
    • (1998) Management Science , vol.44 , pp. 1131-1147
    • Rothkopf, M.H.1    Pekec, A.2    Harstad, R.M.3
  • 21
    • 0003909780 scopus 로고    scopus 로고
    • Report, The California Trust for Power Industry Restructuring
    • Wilson, R., 1997a. Activity rules for the power exchange. Report, The California Trust for Power Industry Restructuring.
    • (1997) Activity Rules for the Power Exchange
    • Wilson, R.1


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