IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v90y2024i1d10.1007_s10898-024-01394-0.html
   My bibliography  Save this article

Characteristic sets and characteristic numbers of matrix two-person games

Author

Listed:
  • D. T. K. Huyen

    (Hanoi Pedagogical University 2
    PHENIKAA University)

  • J.-C. Yao

    (China Medical University)

  • N. D. Yen

    (Vietnam Academy of Science and Technology)

Abstract

Focusing on the extreme points of the solution sets of matrix two-person games, we propose the notions of characteristic sets and characteristic numbers. The characteristic sets (resp., the characteristic numbers) are the sets (resp., the numbers) of the extreme points of the solution set of the game and the optimal solution sets of the players. These concepts allow us to measure the complexity of the game. The larger the characteristic numbers, the more complex the game is. Among other things, we obtain upper bounds for the characteristic numbers and give a novel geometric construction. By the construction, we get useful descriptions of the optimal strategy set of each player of a game given by any nonsingular square matrix. Namely, the investigation of the geometry the just-mentioned sets reduces to computing or studying certain simpler sets. We also formulate several open problems.

Suggested Citation

  • D. T. K. Huyen & J.-C. Yao & N. D. Yen, 2024. "Characteristic sets and characteristic numbers of matrix two-person games," Journal of Global Optimization, Springer, vol. 90(1), pages 217-241, September.
  • Handle: RePEc:spr:jglopt:v:90:y:2024:i:1:d:10.1007_s10898-024-01394-0
    DOI: 10.1007/s10898-024-01394-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-024-01394-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10898-024-01394-0?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. G Appa, 2002. "On the uniqueness of solutions to linear programs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(10), pages 1127-1132, October.
    2. Stephen M. Robinson, 1977. "A Characterization of Stability in Linear Programming," Operations Research, INFORMS, vol. 25(3), pages 435-447, June.
    Full references (including those not matched with items on IDEAS)

    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. Laurent, Monique & Vargas, Luis Felipe, 2022. "Finite convergence of sum-of-squares hierarchies for the stability number of a graph," Other publications TiSEM 3998b864-7504-4cf4-bc1d-f, Tilburg University, School of Economics and Management.
    2. Asimit, Alexandru V. & Bignozzi, Valeria & Cheung, Ka Chun & Hu, Junlei & Kim, Eun-Seok, 2017. "Robust and Pareto optimality of insurance contracts," European Journal of Operational Research, Elsevier, vol. 262(2), pages 720-732.
    3. Amir Akbari & Paul I. Barton, 2018. "An Improved Multi-parametric Programming Algorithm for Flux Balance Analysis of Metabolic Networks," Journal of Optimization Theory and Applications, Springer, vol. 178(2), pages 502-537, August.
    4. M. G. Fiestras-Janeiro & I. Garcia-Jurado & J. Puerto, 2000. "The Concept of Proper Solution in Linear Programming," Journal of Optimization Theory and Applications, Springer, vol. 106(3), pages 511-525, September.
    5. Halidias Nikolaos, 2024. "A novel portfolio optimization method and its application to the hedging problem," Monte Carlo Methods and Applications, De Gruyter, vol. 30(3), pages 249-267.
    6. Holger Scheel & Stefan Scholtes, 2003. "Continuity of DEA Efficiency Measures," Operations Research, INFORMS, vol. 51(1), pages 149-159, February.
    7. Bruce Golden & Linus Schrage & Douglas Shier & Lida Anna Apergi, 2021. "The power of linear programming: some surprising and unexpected LPs," 4OR, Springer, vol. 19(1), pages 15-40, March.
    8. C. Filippi, 2004. "An Algorithm for Approximate Multiparametric Linear Programming," Journal of Optimization Theory and Applications, Springer, vol. 120(1), pages 73-95, January.
    9. Giorgio & Cesare, 2018. "A Tutorial on Sensitivity and Stability in Nonlinear Programming and Variational Inequalities under Differentiability Assumptions," DEM Working Papers Series 159, University of Pavia, Department of Economics and Management.
    10. Ning Zhang & Chang Fang, 2020. "Saddle point approximation approaches for two-stage robust optimization problems," Journal of Global Optimization, Springer, vol. 78(4), pages 651-670, December.
    11. Mangasarian, O.L. & Recht, Benjamin, 2011. "Probability of unique integer solution to a system of linear equations," European Journal of Operational Research, Elsevier, vol. 214(1), pages 27-30, October.
    12. M. J. Cánovas & R. Henrion & M. A. López & J. Parra, 2016. "Outer Limit of Subdifferentials and Calmness Moduli in Linear and Nonlinear Programming," Journal of Optimization Theory and Applications, Springer, vol. 169(3), pages 925-952, June.
    13. Ludwig Kuntz & Stefan Scholtes, 2000. "Measuring the Robustness of Empirical Efficiency Valuations," Management Science, INFORMS, vol. 46(6), pages 807-823, June.
    14. Xiong, Beibei & Chen, Haoxun & An, Qingxian & Wu, Jie, 2019. "A multi-objective distance friction minimization model for performance assessment through data envelopment analysis," European Journal of Operational Research, Elsevier, vol. 279(1), pages 132-142.
    15. Louis Abraham, 2023. "A Game of Competition for Risk," Working Papers hal-04112160, HAL.
    16. Marcel Klatt & Axel Munk & Yoav Zemel, 2022. "Limit laws for empirical optimal solutions in random linear programs," Annals of Operations Research, Springer, vol. 315(1), pages 251-278, August.
    17. Lamb, John D. & Tee, Kai-Hong, 2012. "Resampling DEA estimates of investment fund performance," European Journal of Operational Research, Elsevier, vol. 223(3), pages 834-841.
    18. Dupacova, Jitka & Bertocchi, Marida, 2001. "From data to model and back to data: A bond portfolio management problem," European Journal of Operational Research, Elsevier, vol. 134(2), pages 261-278, October.
    19. Louis Abraham, 2023. "A Game of Competition for Risk," Papers 2305.18941, arXiv.org.
    20. Mark Velednitsky, 2022. "Solving $$(k-1)$$ ( k - 1 ) -stable instances of k-terminal cut with isolating cuts," Journal of Combinatorial Optimization, Springer, vol. 43(2), pages 297-311, March.

    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:jglopt:v:90:y:2024:i:1:d:10.1007_s10898-024-01394-0. 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.