A note on strategy elimination in bimatrix games |
| |
| Institution: | 1. Materials Science, Engineering and Commercialization Program, Texas State University, San Marcos, TX 78666, USA;2. Department of Chemistry and Biochemistry, Texas State University, 601 University Drive, San Marcos, TX 78666, USA;3. Physics Department, Faculty of Science, King Abdulaziz University, Jeddah 21589, Saudi Arabia;1. Research Centre for Energy Resources and Consumption (CIRCE), CIRCE Building – Campus Río Ebro, Mariano Esquillor Gómez, 15, 50018 Zaragoza, Spain;2. University of Zaragoza, Pedro Cerbuna 12, 50009 Zaragoza, Spain;3. AcelorMital Global R&D- Avilés, 3340, Spain;4. CEMEX-Madrid, 28027, Spain;1. Department of Industrial Engineering, Pontifical Catholic University of Rio de Janeiro (PUC-Rio), Brazil;2. Department of Electrical Engineering, Pontifical Catholic University of Rio de Janeiro (PUC-Rio), Brazil;3. School of Business, Universidad Adolfo Ibáñez, Chile;1. Department of Environmental Health, School of Public Health, Shanxi Medical University, Taiyuan 030001, Shanxi, China;2. Department of Nutrition and Food Hygiene, School of Public Health, Qingdao University, Qingdao 266000, Shandong, China |
| |
| Abstract: | In bimatrix games we study the process of successively eliminating strategies which are dominated by other pure strategies. We show how to perform this simplification in O(n3) time, where n is the number of strategies. We also prove that the problem is P-complete, which suggests that it is inherently sequential. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
