| Issue |
ITM Web Conf.
Volume 10, 2017
2017 Seminar on Systems Analysis
|
|
|---|---|---|
| Article Number | 03001 | |
| Number of page(s) | 4 | |
| Section | Complex System Analysis | |
| DOI | https://doi.org/10.1051/itmconf/20171003001 | |
| Published online | 15 March 2017 | |
On Suboptimal Solution of Antagonistic Matrix Games
Moscow Technological University, 119334 Moscow, Russia
* Corresponding author: petrovich4you@gmail.com
The paper examines resource allocation games such as Colonel Blotto and Colonel Lotto games with the goal to develop tractable method for building suboptimal solution in mixed strategies of these games without solving the relevant optimization problem. The foundation of proposed method lies in the specific combinatorial properties of the partition games. It turned out that as far as distribution of resource along battlefield is concerned that pure strategies participating in ε-optimal solution possessed specific structure. Numerical experiments showed that these specific structural peculiarities can be easily reproduced utilizing previously found combinatorial properties of partition. As a result, we get ε-optimal solution of partition games and support set mixed strategies can be computed in polynomial time.
© The Authors, published by EDP Sciences, 2017
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.