Advanced Search
MyIDEAS: Login to save this paper or follow this series

A Markov Game Approach For Optimal Routing Into A Queueing Network

Contents:

Author Info

  • Eitan ALTMAN

    (INRIA, 2004 Route des Lucioles, BP93, 06902 Sophia-Antipolis Cedex, France)

Registered author(s):

    Abstract

    We study a dynamic optimal routing problem, where a controller has to decide to which of two queues should arriving customers (representing packets, messages, call etc...) be sent. The service rate in each queue may depend on the state of the system, may change in time and is unknown to the controller. The goal of the controller is to design a strategy that guarantees the best performance under the worst case service conditions. The payoff is composed of a holding cost, an admission cost, and a cost that depends on the quality of the service. We consider both the finite and infinite horizon discounted cost and the expected average cost. The problem is studied in the framework of zero-sum Markov games where the server, called player 1, is assumed to play against the router, called player 2. Each player is assumed to have the information of all previous actions of both players as well as the current and past states of the system. We show that there exist pure optimal strategies for both players. A value iteration algorithm is used to establish properties of the value of the game, which are related to supermodularity and to convexity. This is then shown to imply the existence of optimal strategies described by

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://128.118.178.162/eps/game/papers/9401/9401002.pdf
    Download Restriction: no

    File URL: http://128.118.178.162/eps/game/papers/9401/9401002.tex
    Download Restriction: no

    File URL: http://128.118.178.162/eps/game/papers/9401/9401002.ps.gz
    Download Restriction: no

    Bibliographic Info

    Paper provided by EconWPA in its series Game Theory and Information with number 9401002.

    as in new window
    Length: 12 pages
    Date of creation: 25 Jan 1994
    Date of revision:
    Handle: RePEc:wpa:wuwpga:9401002

    Note: 12 pages, LateX file
    Contact details of provider:
    Web page: http://128.118.178.162

    Related research

    Keywords:

    Find related papers by JEL classification:

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. Arie Hordijk & Olaf Passchier & Floske Spieksma, 1997. "Optimal service control against worst case admission policies: A multichained stochastic game," Computational Statistics, Springer, vol. 45(2), pages 281-301, June.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:wpa:wuwpga:9401002. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (EconWPA).

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

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