메뉴 건너뛰기




Volumn 189, Issue 3, 2008, Pages 1393-1402

An overview of Stackelberg pricing in networks

Author keywords

Branch and bound; Pricing; Shortest path graph; Stackelberg game

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; DECISION MAKING; PROBLEM SOLVING;

EID: 40849140756     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.08.064     Document Type: Article
Times cited : (53)

References (16)
  • 3
    • 0034245218 scopus 로고    scopus 로고
    • A bilevel model and solution algorithm for a freight tariff-setting problem
    • Brotcorne L., Labbé M., Marcotte P., and Savard G. A bilevel model and solution algorithm for a freight tariff-setting problem. Transportation Science 34 3 (2000) 289-302
    • (2000) Transportation Science , vol.34 , Issue.3 , pp. 289-302
    • Brotcorne, L.1    Labbé, M.2    Marcotte, P.3    Savard, G.4
  • 4
    • 0035520345 scopus 로고    scopus 로고
    • A bilevel model for toll optimization on a multicommodity transportation network
    • Brotcorne L., Labbé M., Marcotte P., and Savard G. A bilevel model for toll optimization on a multicommodity transportation network. Transportation Science 35 4 (2001) 345-358
    • (2001) Transportation Science , vol.35 , Issue.4 , pp. 345-358
    • Brotcorne, L.1    Labbé, M.2    Marcotte, P.3    Savard, G.4
  • 5
    • 40849105771 scopus 로고    scopus 로고
    • Brotcorne, L., Labbé, M., Marcotte, P., Savard, G., 2005. Joint design and pricing on a network. Working paper.
    • Brotcorne, L., Labbé, M., Marcotte, P., Savard, G., 2005. Joint design and pricing on a network. Working paper.
  • 6
    • 40849146423 scopus 로고    scopus 로고
    • Dewez, S., 2004. On the toll setting problem. Ph.D. dissertation, Université Libre de Bruxelles.
    • Dewez, S., 2004. On the toll setting problem. Ph.D. dissertation, Université Libre de Bruxelles.
  • 7
    • 0033873349 scopus 로고    scopus 로고
    • Fortz, B., Thorup, M., 2000. Internet traffic engineering by optimizing OSPF weights. In: Proceedings of the 19th IEEE Conference on Computer Communications (INFOCOM), pp. 519-528.
    • Fortz, B., Thorup, M., 2000. Internet traffic engineering by optimizing OSPF weights. In: Proceedings of the 19th IEEE Conference on Computer Communications (INFOCOM), pp. 519-528.
  • 8
    • 40849112457 scopus 로고    scopus 로고
    • Grigoriev, A., van Hoesel, S., van der Kraaij, A.F., Uetz, M., Bouhtou, M., in press. Pricing network edges to cross a river. Naval Research Logistics Quarterly.
    • Grigoriev, A., van Hoesel, S., van der Kraaij, A.F., Uetz, M., Bouhtou, M., in press. Pricing network edges to cross a river. Naval Research Logistics Quarterly.
  • 9
    • 0022077119 scopus 로고
    • The polynomial hierarchy and a simple model for competitive analysis
    • Jeroslow R.G. The polynomial hierarchy and a simple model for competitive analysis. Mathematical Programming 32 (1985) 146-164
    • (1985) Mathematical Programming , vol.32 , pp. 146-164
    • Jeroslow, R.G.1
  • 10
    • 0032295962 scopus 로고    scopus 로고
    • A bilevel model of taxation and its application to optimal highway pricing
    • Labbé M., Marcotte P., and Savard G. A bilevel model of taxation and its application to optimal highway pricing. Management Science 44 (1998) 1608-1622
    • (1998) Management Science , vol.44 , pp. 1608-1622
    • Labbé, M.1    Marcotte, P.2    Savard, G.3
  • 11
    • 23244451228 scopus 로고    scopus 로고
    • Design and analysis of an approximation algorithm for Stackelberg network pricing
    • Roch S., Savard G., and Marcotte P. Design and analysis of an approximation algorithm for Stackelberg network pricing. Networks 46 1 (2005) 57-67
    • (2005) Networks , vol.46 , Issue.1 , pp. 57-67
    • Roch, S.1    Savard, G.2    Marcotte, P.3
  • 12
    • 0035176171 scopus 로고    scopus 로고
    • Roughgarden, T., 2001. Designing networks for selfish users is hard. In: Proceedings of the 42nd Annual IEEE Symposium on the Foundations of Computer Science, pp. 472-482.
    • Roughgarden, T., 2001. Designing networks for selfish users is hard. In: Proceedings of the 42nd Annual IEEE Symposium on the Foundations of Computer Science, pp. 472-482.
  • 13
    • 0034497242 scopus 로고    scopus 로고
    • Roughgarden, T., Tardos, E., 2000. How bad is selfish routing? In: Proceedings of the 41st Annual IEEE Symposium on the Foundations of Computer Science, pp. 93-102.
    • Roughgarden, T., Tardos, E., 2000. How bad is selfish routing? In: Proceedings of the 41st Annual IEEE Symposium on the Foundations of Computer Science, pp. 93-102.
  • 14
    • 40849093561 scopus 로고    scopus 로고
    • van der Kraaij, A.F., 2004. Pricing in networks. Ph.D. dissertation, University Maastricht.
    • van der Kraaij, A.F., 2004. Pricing in networks. Ph.D. dissertation, University Maastricht.
  • 16
    • 0000527046 scopus 로고
    • Bilevel and multilevel programming: A bibliography review
    • Vicente L.N., and Calamai P.H. Bilevel and multilevel programming: A bibliography review. Journal of Global Optimization 5 (1994) 291-306
    • (1994) Journal of Global Optimization , vol.5 , pp. 291-306
    • Vicente, L.N.1    Calamai, P.H.2


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