IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-00142-0_83.html
   My bibliography  Save this book chapter

Multilayered Network Games: Algorithms for Solving Discrete Optimal Control Problems with Infinite Time Horizon via Minimal Mean Cost Cycles and a Game-Theoretical Approach

In: Operations Research Proceedings 2008

Author

Listed:
  • Dmitrii Lozovanu

    (University of Heidelberg, Institute of Mathematics and Computer Science, Academy of Sciences)

  • Stefan Pickl

    (Universäitat der Bundeswehr, Institut fur Angewandte Systemwissenschaften und Wirtschaftsinformatik, Fakultät fur Informatik)

Abstract

Summary We extend a classical discrete optimal control problem in such a way that the feasible sets and the costs depend now on the parameter t: Such problems occur for example in (multilayered) emission trading games which are introduced by the authors [8]. Here, we develop two possible characterizations and solution principles. One is based on a classical linear programming approach. The other one exploits a game-theoretic treatment. Via these aprroaches we can solve the problem even for the case that we handle with an arbitrary transition function

Suggested Citation

  • Dmitrii Lozovanu & Stefan Pickl, 2009. "Multilayered Network Games: Algorithms for Solving Discrete Optimal Control Problems with Infinite Time Horizon via Minimal Mean Cost Cycles and a Game-Theoretical Approach," Springer Books, in: Bernhard Fleischmann & Karl-Heinz Borgwardt & Robert Klein & Axel Tuma (ed.), Operations Research Proceedings 2008, chapter 83, pages 513-518, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-00142-0_83
    DOI: 10.1007/978-3-642-00142-0_83
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-642-00142-0_83. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.