IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-3-031-91357-0_14.html

Approximating Multicriteria Matrix Game Solution with Finite Sets

In: Theory, Algorithms, and Experiments in Applied Optimization

Author

Listed:
  • Natalia M. Novikova

    (Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences)

  • Irina I. Pospelova

    (Lomonosov Moscow State University)

Abstract

The problem of representing the solution and the value of a multicriteria mixed strategy matrix game by finite sets is considered. According to Shapley’s ideas, linear scalarization is applied to the vector payoffs in the game. By this, the game is reduced to a parametric set of scalar bimatrix games. On the sets of the parameters, we construct a special finite δ $$\delta $$ -net for approximating the solution and the value sets of the initial game. For multicriteria games with 2 × 2 $$2\times 2$$ matrices, explicit formulas for the nodes of the δ $$\delta $$ -net are given by solving the degenerate bimatrix games obtained in the scalarization process. We prove the convergence of the finite set formed of game equilibria corresponding to the δ $$\delta $$ -net nodes to the solution of the initial game in Hausdorff metric. Examples of two-criteria 2 × 2 $$2\times 2$$ games are given; they visualize finite approximation of non-convex equilibrium sets.

Suggested Citation

  • Natalia M. Novikova & Irina I. Pospelova, 2025. "Approximating Multicriteria Matrix Game Solution with Finite Sets," Springer Optimization and Its Applications, in: Boris Goldengorin (ed.), Theory, Algorithms, and Experiments in Applied Optimization, pages 295-313, Springer.
  • Handle: RePEc:spr:spochp:978-3-031-91357-0_14
    DOI: 10.1007/978-3-031-91357-0_14
    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

    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:spochp:978-3-031-91357-0_14. 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.