Slim Belhaiza, Charles Audet
and Pierre Hansen
Article (2014)
 Open Acess document in PolyPublie and at official publisher |
|
Open Access to the full text of this document Published Version Terms of Use: Creative Commons Attribution Download (271kB) |
Abstract
In this paper, we implement automatic procedures to enumerate all Nash maximal subsets of a bimatrix game and compute their dimensions. We propose a linear programming approach to identify extreme perfect Nash equilibria, enumerate all Selten maximal subsets and compute their dimensions. We present the Eχ-MIPerfect and the EEE-Perfect algorithms which enumerate all extreme perfect Nash equilibria. We finally report and comment computational experiments on randomly generated bimatrix games with different size and density
| Department: | Department of Mathematics and Industrial Engineering |
|---|---|
| Research Center: | GERAD - Research Group in Decision Analysis |
| Funders: | KFUPM, Deanship of Scientific Research |
| Grant number: | IN101038 |
| PolyPublie URL: | https://publications.polymtl.ca/4776/ |
| Journal Title: | Arabian Journal of Mathematics (vol. 3, no. 3) |
| Publisher: | Springer |
| DOI: | 10.1007/s40065-014-0101-x |
| Official URL: | https://doi.org/10.1007/s40065-014-0101-x |
| Date Deposited: | 08 Apr 2021 09:50 |
| Last Modified: | 08 Jan 2026 04:15 |
| Cite in APA 7: | Belhaiza, S., Audet, C., & Hansen, P. (2014). A note on bimatrix game maximal Selten subsets. Arabian Journal of Mathematics, 3(3), 299-311. https://doi.org/10.1007/s40065-014-0101-x |
|---|---|
Statistics
Total downloads
Downloads per month in the last year
Origin of downloads
Dimensions
Repository Staff Only
|
View Item |
