IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v102y1999i1d10.1023_a1021854814980.html
   My bibliography  Save this article

Pareto-Optimal Security Strategies as Minimax Strategies of a Standard Matrix Game

Author

Listed:
  • M. Voorneveld

    (Tilburg University)

Abstract

We prove that, in a multicriteria matrix game, a strategy is a Pareto-optimal security strategy if and only if it is a minimax strategy of a standard matrix game that is obtained by a suitable weighting of the criteria.

Suggested Citation

  • M. Voorneveld, 1999. "Pareto-Optimal Security Strategies as Minimax Strategies of a Standard Matrix Game," Journal of Optimization Theory and Applications, Springer, vol. 102(1), pages 203-210, July.
    • Handle: RePEc:spr:joptap:v:102:y:1999:i:1:d:10.1023_a:1021854814980
    DOI: 10.1023/A:1021854814980
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1021854814980
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1021854814980?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    References listed on IDEAS

    as
    1. Borm, Peter & Garcia-Jurado, Ignacio & Potters, Jos & Tijs, Stef, 1996. "An amalgation of games," European Journal of Operational Research, Elsevier, vol. 89(3), pages 570-580, March.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. A. Zapata & A. M. Mármol & L. Monroy & M. A. Caraballo, 2019. "A Maxmin Approach for the Equilibria of Vector-Valued Games," Group Decision and Negotiation, Springer, vol. 28(2), pages 415-432, April.
    2. I. Nishizaki & T. Notsu, 2007. "Nondominated Equilibrium Solutions of a Multiobjective Two-Person Nonzero-Sum Game and Corresponding Mathematical Programming Problem," Journal of Optimization Theory and Applications, Springer, vol. 135(2), pages 217-239, November.
    3. Naouel Yousfi-Halimi & Mohammed Said Radjef & Hachem Slimani, 2018. "Refinement of pure Pareto Nash equilibria in finite multicriteria games using preference relations," Annals of Operations Research, Springer, vol. 267(1), pages 607-628, August.
    4. Karima Fahem & Mohammed Radjef, 2015. "Properly efficient Nash equilibrium in multicriteria noncooperative games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 82(2), pages 175-193, October.
    5. Stefan Rass & Sandra König & Stefan Schauer, 2017. "Defending Against Advanced Persistent Threats Using Game-Theory," PLOS ONE, Public Library of Science, vol. 12(1), pages 1-43, January.
    6. Luisa Monroy & Amparo M. Mármol & Victoriana Rubiales, 2005. "A bargaining model for finite n-person multi-criteria games," Economic Working Papers at Centro de Estudios Andaluces E2005/21, Centro de Estudios Andaluces.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Marcel Dreef & Peter Borm, 2006. "On the role of chance moves and information in two-person games," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 14(1), pages 75-98, June.
    2. Peeters, R.J.A.P. & Potters, J.A.M., 1999. "Sender-Receiver Games," Other publications TiSEM 38f414c1-bc92-4565-8ba6-d, Tilburg University, School of Economics and Management.
    3. Gianfranco Gambarelli & Daniele Gervasio & Francesca Maggioni & Daniel Faccini, 2022. "A Stackelberg game for the Italian tax evasion problem," Computational Management Science, Springer, vol. 19(2), pages 295-307, June.

    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:joptap:v:102:y:1999:i:1:d:10.1023_a:1021854814980. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc 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 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.