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

Characterization of optimal strategies in matrix games with convexity properties

Author

Listed:
  • Tadeusz Radzik

    (Institute of Mathematics, Wroclaw University of Technology, Wybrzeze Wyspianskiego 27, 50-370 Wroclaw, Poland)

Abstract

This paper gives a full characterization of matrices with rows and columns having properties closely related to the (quasi-) convexity-concavity of functions. The matrix games described by such payoff matrices well approximate continuous games on the unit square with payoff functions F (x, y) concave in x for each y, and convex in y for each x. It is shown that the optimal strategies in such matrix games have a very simple structure and a search-procedure is given. The results have a very close relationship with the known theorem of Debreu and Glicksberg about the existence of a pure Nash equilibrium in n-person games.

Suggested Citation

  • Tadeusz Radzik, 2000. "Characterization of optimal strategies in matrix games with convexity properties," International Journal of Game Theory, Springer;Game Theory Society, vol. 29(2), pages 211-227.
    • Handle: RePEc:spr:jogath:v:29:y:2000:i:2:p:211-227
    Note: Received: May 1997/Final version: August 1999
    as

    Download full text from publisher

    File URL: http://link.springer.de/link/service/journals/00182/papers/0029002/00290211.pdf
    Download Restriction: Access to the full text of the articles in this series is restricted
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Tadeusz Radzik, 2014. "Poor convexity and Nash equilibria in games," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(1), pages 169-192, February.
    2. Wojciech Połowczuk & Piotr Więcek & Tadeusz Radzik, 2007. "On the existence of almost-pure-strategy Nash equilibrium in n-person finite games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 65(1), pages 141-152, February.

    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:29:y:2000:i:2:p:211-227. 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.