메뉴 건너뛰기




Volumn , Issue , 2011, Pages 77-86

Welfare and profit maximization with production costs

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL MATHEMATICS; COMMERCE; COMPUTER SCIENCE; COST FUNCTIONS; ECONOMICS; MACHINE DESIGN; PROFITABILITY; SALES;

EID: 84863324294     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2011.68     Document Type: Conference Paper
Times cited : (44)

References (15)
  • 2
    • 84906272704 scopus 로고    scopus 로고
    • An approximate truthful mechanism for combinatorial auctions with single parameter agents
    • A. Archer, C. Papadimitriou, K. Talwar, and É. Tardos, "An approximate truthful mechanism for combinatorial auctions with single parameter agents," Internet Math., vol. 1, no. 2, 2004.
    • (2004) Internet Math. , vol.1 , Issue.2
    • Archer, A.1    Papadimitriou, C.2    Talwar, K.3    Tardos, É.4
  • 3
    • 0027883370 scopus 로고
    • Throughput-competitive on-line routing
    • B. Awerbuch, Y. Azar, and S. Plotkin, "Throughput-competitive on-line routing," in FOCS, 1993.
    • (1993) FOCS
    • Awerbuch, B.1    Azar, Y.2    Plotkin, S.3
  • 4
    • 0038784573 scopus 로고    scopus 로고
    • Reducing truth-telling online mechanisms to online optimization
    • B. Awerbuch, Y. Azar, and A. Meyerson, "Reducing truth-telling online mechanisms to online optimization," in 35th STOC, 2003.
    • 35th STOC, 2003
    • Awerbuch, B.1    Azar, Y.2    Meyerson, A.3
  • 6
    • 85013990027 scopus 로고    scopus 로고
    • Incentive compatible multi unit combinatorial auctions
    • Y. Bartal, R. Gonen, and N. Nisan, "Incentive compatible multi unit combinatorial auctions," in 9th TARK, 2003.
    • 9th TARK, 2003
    • Bartal, Y.1    Gonen, R.2    Nisan, N.3
  • 7
    • 84926088134 scopus 로고    scopus 로고
    • Combinatorial auctions
    • Cambridge University Press
    • L. Blumrosen and N. Nisan, "Combinatorial auctions," in Algorithmic Game Theory. Cambridge University Press, 2007.
    • (2007) Algorithmic Game Theory
    • Blumrosen, L.1    Nisan, N.2
  • 9
    • 33746377154 scopus 로고    scopus 로고
    • Approximation techniques for utilitarian mechanism design
    • P. Briest, P. Krysta, and B. Vöcking, "Approximation techniques for utilitarian mechanism design," in STOC, 2005.
    • (2005) STOC
    • Briest, P.1    Krysta, P.2    Vöcking, B.3
  • 10
    • 77952324662 scopus 로고    scopus 로고
    • Dynamic and non-uniform pricing strategies for revenue maximization
    • T. Chakraborty, Z. Huang, and S. Khanna, "Dynamic and non-uniform pricing strategies for revenue maximization," in FOCS, 2009.
    • (2009) FOCS
    • Chakraborty, T.1    Huang, Z.2    Khanna, S.3
  • 11
    • 77950910973 scopus 로고    scopus 로고
    • Two randomized mechanisms for combinatorial auctions
    • S. Dobzinski, "Two randomized mechanisms for combinatorial auctions," in APPROX/RANDOM, 2007.
    • (2007) Approx/Random
    • Dobzinski, S.1
  • 12
    • 77949388489 scopus 로고    scopus 로고
    • Approximation algorithms for combinatorial auctions with complement-free bidders
    • S. Dobzinski, N. Nisan, and M. Schapira, "Approximation algorithms for combinatorial auctions with complement-free bidders," Math. of OR, vol. 35, no. 1.
    • Math. of or , vol.35 , Issue.1
    • Dobzinski, S.1    Nisan, N.2    Schapira, M.3
  • 13
    • 84926134377 scopus 로고    scopus 로고
    • Profit maximization in mechanism design
    • Cambridge University Press
    • J. Hartline and A. Karlin, "Profit maximization in mechanism design," in Algorithmic Game Theory. Cambridge University Press, 2007.
    • (2007) Algorithmic Game Theory
    • Hartline, J.1    Karlin, A.2
  • 14
    • 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 46th FOCS, 2005.
    • 46th FOCS, 2005
    • Lavi, R.1    Swamy, C.2


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