메뉴 건너뛰기




Volumn , Issue , 2012, Pages 936-944

When cloud meets eBay: Towards effective pricing for cloud computing

Author keywords

[No Author keywords available]

Indexed keywords

AMAZON EC2; CLOUD PROVIDERS; CLOUD SERVICES; COMPUTATIONALLY EFFICIENT; COMPUTING RESOURCE; DISHONEST USERS; EXTENSIVE SIMULATIONS; NETWORK USERS; PAY-AS-YOU-GO; POLYNOMIAL COMPLEXITY; PRICING MECHANISM; PRICING MODELS; RESOURCE MARKETS; RESOURCE SCARCITY; SPOT PRICE;

EID: 84861597727     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2012.6195844     Document Type: Conference Paper
Times cited : (152)

References (17)
  • 3
    • 65749112026 scopus 로고    scopus 로고
    • Amazon.com, Online at
    • Amazon.com, "Amazon elastic compute cloud," Online at http://aws.amazon.com/ec2/, 2009.
    • (2009) Amazon Elastic Compute Cloud
  • 5
    • 0032141895 scopus 로고    scopus 로고
    • Computationally manageable combinational auctions
    • August
    • M. H. Rothkopf, A. Pekec, and R. M. Harstad, "Computationally manageable combinational auctions," Manage. Sci., vol. 44, pp. 1131-1147, August 1998.
    • (1998) Manage. Sci. , vol.44 , pp. 1131-1147
    • Rothkopf, M.H.1    Pekec, A.2    Harstad, R.M.3
  • 6
    • 0242550383 scopus 로고    scopus 로고
    • Truth revelation in approximately efficient combinatorial auctions
    • September
    • D. Lehmann, L. I. Oćallaghan, and Y. Shoham, "Truth revelation in approximately efficient combinatorial auctions," J. ACM, vol. 49, pp. 577-602, September 2002.
    • (2002) J. ACM , vol.49 , pp. 577-602
    • Lehmann, D.1    Oćallaghan, L.I.2    Shoham, Y.3
  • 8
    • 0036932302 scopus 로고    scopus 로고
    • Truthful approximation mechanisms for restricted combinatorial auctions: Extended abstract
    • A. Mu'alem and N. Nisan, "Truthful approximation mechanisms for restricted combinatorial auctions: extended abstract," in Proc. of AI'02, Menlo Park, CA, USA, 2002, pp. 379-384.
    • Proc. of AI'02, Menlo Park, CA, USA, 2002 , pp. 379-384
    • Mu'alem, A.1    Nisan, N.2
  • 10
    • 85040831051 scopus 로고    scopus 로고
    • Optimal solutions for multi-unit combinatorial auctions: Branch and bound heuristics
    • R. Gonen and D. Lehmann, "Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics," in Proc. of EC'00, New York, NY, USA, 2000, pp. 13-20.
    • Proc. of EC'00, New York, NY, USA, 2000 , pp. 13-20
    • Gonen, R.1    Lehmann, D.2
  • 12
    • 33748120378 scopus 로고    scopus 로고
    • Truthful and near-optimal mechanism design via linear programming
    • R. Lavi and C. Swamy, "Truthful and near-optimal mechanism design via linear programming," in Proc. of FOCS'05, Washington, DC, USA, 2005, pp. 595-604.
    • Proc. of FOCS'05, Washington, DC, USA, 2005 , pp. 595-604
    • Lavi, R.1    Swamy, C.2
  • 17
    • 84980096808 scopus 로고
    • Counterspeculation, auctions, and competitive sealed tenders
    • W. Vickrey, "Counterspeculation, auctions, and competitive sealed tenders,"The Journal of Finance, vol. 16, no. 1, pp. 8-37, 1961.
    • (1961) The Journal of Finance , vol.16 , Issue.1 , pp. 8-37
    • Vickrey, W.1


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