IDEAS home Printed from https://ideas.repec.org/a/ids/ijmtma/v12y2007i4p327-341.html
   My bibliography  Save this article

The constraints of the valuation distribution for solving a class of games by using a best response algorithm

Author

Listed:
  • Gangshu Cai
  • Jie Zhong
  • Peter R. Wurman

Abstract

Infinite games with incomplete information are common in practice. First-price, sealed-bid auctions are a prototypical example. To solve this kind of infinite game, a heuristic approach is to discretise the strategy spaces and enumerate to approximate the equilibrium strategies. However, an approximate algorithm might not be guaranteed to converge. This paper discusses the utilisation of a best response algorithm in solving infinite games with incomplete information. We show the constraints of the valuation distributions define the necessary conditions of the convergence of the best response algorithm for several classes of infinite games, including auctions. A salient feature of the necessary convergence conditions lies in that they can be employed to compute the exact Nash equilibria without discretising the strategy space if the best response algorithm converges.

Suggested Citation

  • Gangshu Cai & Jie Zhong & Peter R. Wurman, 2007. "The constraints of the valuation distribution for solving a class of games by using a best response algorithm," International Journal of Manufacturing Technology and Management, Inderscience Enterprises Ltd, vol. 12(4), pages 327-341.
    • Handle: RePEc:ids:ijmtma:v:12:y:2007:i:4:p:327-341
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=13756
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    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:ids:ijmtma:v:12:y:2007:i:4:p:327-341. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=21 .

    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.