New algorithm for checking Pareto optimality in bimatrix games

Richárd Kicsiny () and Zoltán Varga
Additional contact information
Richárd Kicsiny: Hungarian University of Agriculture and Life Sciences
Zoltán Varga: Hungarian University of Agriculture and Life Sciences

Annals of Operations Research, 2023, vol. 320, issue 1, No 9, 235-259

Abstract: Abstract Bimatrix games have had theoretical importance and important applications since the very beginning of game theory to date. Pareto optimal strategy vectors represent a reasonable and frequently applied solution concept (basically in the cooperative approach). Particularly, it often arises whether a non-cooperative solution can be improved in cooperative sense, i.e. it is Pareto optimal or not. However, in concrete cases it may be hard to determine the Pareto optimal strategy vectors or at least check the Pareto optimality of a given strategy vector. In the present paper, the Pareto optimality of the strategy pairs in general n × m ( $$n = 2,3, \ldots$$ n = 2 , 3 , … ; $$m = 2,3, \ldots$$ m = 2 , 3 , … ) bimatrix games is studied. First of all an elementary proof is provided for a theorem, which makes the proposed Pareto optimality checking algorithm simpler. Then a nonlinear transform is proposed, which makes the algorithm even more convenient in the important case of 2 × 2 bimatrix games (and for certain other cases). Two numerical examples present the practical applicability of the checking algorithm. The problem of 2 × 2 bimatrix games can be solved even by hand. For larger games, numerous computational tools are available in the practice to apply the checking algorithm in exact or at least approximate way.

Keywords: Game theory; Bimatrix games; Pareto optimality; Checking algorithm; Nonlinear transform (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-022-04912-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:320:y:2023:i:1:d:10.1007_s10479-022-04912-z

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-022-04912-z

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().