IDEAS home Printed from https://ideas.repec.org/a/spr/jogath/v26y1998i4p579-582.html
   My bibliography  Save this article

Note Some Bounds for Markov Chains

Author

Listed:
  • Mark B. Cronshaw

    (Economics Institute, 1030 13th Street, Boulder, CO 80302, USA)

  • Levon S. Kazarian

    (Department of Economics, University of Colorado, Boulder, CO 80309-0256, USA)

Abstract

In principle it is possible to characterize the long run behaviour of any evolutionary game by finding an analytical expression for its limit probability distribution. However, it is cumbersome to do so when the state space is large and the rate of mutation is significant. This paper gives upper and lower bounds for the limit distribution, which are easy to compute. The bounds are expressed in terms of the maximal and minimal row sums of parts of the transition matrix.

Suggested Citation

  • Mark B. Cronshaw & Levon S. Kazarian, 1998. "Note Some Bounds for Markov Chains," International Journal of Game Theory, Springer;Game Theory Society, vol. 26(4), pages 579-582.
    • Handle: RePEc:spr:jogath:v:26:y:1998:i:4:p:579-582
    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 search for a similarly titled item that would be available.

    More about this item

    Keywords

    Evolutionary games; Markov chain;

    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:jogath:v:26:y:1998:i:4:p:579-582. 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.