IDEAS home Printed from https://ideas.repec.org/a/wly/jnlaaa/v2011y2011i1n260490.html

A Graphical Method for Solving Interval Matrix Games

Author

Listed:
  • Handan Akyar
  • Emrah Akyar

Abstract

2 × n or m × 2 interval matrix games are considered, and a graphical method for solving such games is given. Interval matrix game is the interval generation of classical matrix games. Because of uncertainty in real‐world applications, payoffs of a matrix game may not be a fixed number. Since the payoffs may vary within a range for fixed strategies, an interval‐valued matrix can be used to model such uncertainties. In the literature, there are different approaches for the comparison of fuzzy numbers and interval numbers. In this work, the idea of acceptability index is used which is suggested by Sengupta et al. (2001) and Sengupta and Pal (2009), and in view of acceptability index, well‐known graphical method for matrix games is adapted to interval matrix games.

Suggested Citation

  • Handan Akyar & Emrah Akyar, 2011. "A Graphical Method for Solving Interval Matrix Games," Abstract and Applied Analysis, John Wiley & Sons, vol. 2011(1).
    • Handle: RePEc:wly:jnlaaa:v:2011:y:2011:i:1:n:260490
    DOI: 10.1155/2011/260490
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2011/260490
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2011/260490?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
    ---><---

    References listed on IDEAS

    as
    1. Prasun Kumar Nayak & Madhumangal Pal, 2009. "Linear Programming Technique To Solve Two Person Matrix Games With Interval Pay-Offs," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 26(02), pages 285-305.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Emrah Akyar, 2012. "A Fictitious Play Algorithm for Matrix Games with Fuzzy Payoffs," Abstract and Applied Analysis, John Wiley & Sons, vol. 2012(1).

    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. Sanjiv Kumar & Ritika Chopra & Ratnesh R. Saxena, 2016. "A Fast Approach to Solve Matrix Games with Payoffs of Trapezoidal Fuzzy Numbers," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(06), pages 1-14, December.
    2. Li, Deng-Feng, 2012. "A fast approach to compute fuzzy values of matrix games with payoffs of triangular fuzzy numbers," European Journal of Operational Research, Elsevier, vol. 223(2), pages 421-429.
    3. Li, Deng-Feng, 2011. "Linear programming approach to solve interval-valued matrix games," Omega, Elsevier, vol. 39(6), pages 655-666, December.
    4. Liu, Zhi & Zheng, Xiao-Xue & Li, Deng-Feng & Liao, Chen-Nan & Sheu, Jiuh-Biing, 2021. "A novel cooperative game-based method to coordinate a sustainable supply chain under psychological uncertainty in fairness concerns," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).
    5. Laxminarayan Sahoo, 2019. "Solving matrix games with linguistic payoffs," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 10(4), pages 484-490, August.
    6. Deng, Xinyang & Liu, Qi & Deng, Yong, 2016. "Matrix games with payoffs of belief structures," Applied Mathematics and Computation, Elsevier, vol. 273(C), pages 868-879.
    7. Ajay Kumar Bhurjee & Geetanjali Panda, 2017. "Optimal strategies for two-person normalized matrix game with variable payoffs," Operational Research, Springer, vol. 17(2), pages 547-562, July.

    More about this item

    Statistics

    Access and download statistics

    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:wly:jnlaaa:v:2011:y:2011:i:1:n:260490. 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/4058 .

    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.