Advanced Search
MyIDEAS: Login to save this article or follow this journal

A fast approach to compute fuzzy values of matrix games with payoffs of triangular fuzzy numbers

Contents:

Author Info

  • Li, Deng-Feng
Registered author(s):

    Abstract

    The aim of this paper is to develop an effective method for solving matrix games with payoffs of triangular fuzzy numbers (TFNs) which are arbitrary. In this method, it always assures that players’ gain-floor and loss-ceiling have a common TFN-type fuzzy value and hereby any matrix game with payoffs of TFNs has a TFN-type fuzzy value. Based on duality theorem of linear programming (LP) and the representation theorem for fuzzy sets, the mean and the lower and upper limits of the TFN-type fuzzy value are easily computed through solving the derived LP models with data taken from 1-cut set and 0-cut set of fuzzy payoffs. Hereby the TFN-type fuzzy value of any matrix game with payoffs of TFNs can be explicitly obtained. Moreover, we can easily compute the upper and lower bounds of any Alfa-cut set of the TFN-type fuzzy value for any matrix game with payoffs of TFNs and players’ optimal mixed strategies through solving the derived LP models at any specified confidence level Alfa. The proposed method in this paper is demonstrated with a numerical example and compared with other methods to show the validity, applicability and superiority.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.sciencedirect.com/science/article/pii/S0377221712004754
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Elsevier in its journal European Journal of Operational Research.

    Volume (Year): 223 (2012)
    Issue (Month): 2 ()
    Pages: 421-429

    as in new window
    Handle: RePEc:eee:ejores:v:223:y:2012:i:2:p:421-429

    Contact details of provider:
    Web page: http://www.elsevier.com/locate/eor

    Related research

    Keywords: I. Game theory; S. Fuzzy sets; S. Group decisions and negotiations; I. Linear programming; P. Uncertainty modeling;

    References

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
    as in new window
    1. Bergantiños, Gustavo & Vidal-Puga, Juan, 2010. "Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms," European Journal of Operational Research, Elsevier, vol. 201(3), pages 811-820, March.
    2. Kimms, Alf & Çetiner, Demet, 2012. "Approximate nucleolus-based revenue sharing in airline alliances," European Journal of Operational Research, Elsevier, vol. 220(2), pages 510-521.
    3. Brânzei, R. & Dimitrov, D.A. & Tijs, S.H., 2002. "Hypercubes and Compromise Values for Cooperative Fuzzy Games," Discussion Paper 2002-14, Tilburg University, Center for Economic Research.
    4. Chevalier-Roignant, Benoît & Flath, Christoph M. & Huchzermeier, Arnd & Trigeorgis, Lenos, 2011. "Strategic investment under uncertainty: A synthesis," European Journal of Operational Research, Elsevier, vol. 215(3), pages 639-650, December.
    5. Deng-Feng Li, 2011. "Notes On "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. 28(06), pages 705-737.
    6. 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.
    7. Xiao, Ping & Tang, Christopher S. & Wirtz, Jochen, 2011. "Optimizing referral reward programs under impression management considerations," European Journal of Operational Research, Elsevier, vol. 215(3), pages 730-739, December.
    8. Tijs, Stef & Borm, Peter & Lohmann, Edwin & Quant, Marieke, 2011. "An average lexicographic value for cooperative games," European Journal of Operational Research, Elsevier, vol. 213(1), pages 210-220, August.
    9. Bilbao, J.M. & Jiménez, N. & López, J.J., 2010. "The selectope for bicooperative games," European Journal of Operational Research, Elsevier, vol. 204(3), pages 522-532, August.
    10. S. Alparslan-Gök & Silvia Miquel & Stef Tijs, 2009. "Cooperation under interval uncertainty," Computational Statistics, Springer, vol. 69(1), pages 99-109, March.
    11. Jiménez-Losada, Andrés & Fernández, Julio R. & Ordóñez, Manuel & Grabisch, Michel, 2010. "Games on fuzzy communication structures with Choquet players," European Journal of Operational Research, Elsevier, vol. 207(2), pages 836-847, December.
    12. Li, Shujin & Zhang, Qiang, 2009. "A simplified expression of the Shapley function for fuzzy game," European Journal of Operational Research, Elsevier, vol. 196(1), pages 234-245, July.
    13. Butnariu, Dan & Kroupa, Tomas, 2008. "Shapley mappings and the cumulative value for n-person games with fuzzy coalitions," European Journal of Operational Research, Elsevier, vol. 186(1), pages 288-299, April.
    14. Han, Deren & Zhang, Hongchao & Qian, Gang & Xu, Lingling, 2012. "An improved two-step method for solving generalized Nash equilibrium problems," European Journal of Operational Research, Elsevier, vol. 216(3), pages 613-623.
    15. Viscolani, Bruno, 2012. "Pure-strategy Nash equilibria in an advertising game with interference," European Journal of Operational Research, Elsevier, vol. 216(3), pages 605-612.
    16. SeyedEsfahani, Mir Mehdi & Biazaran, Maryam & Gharakhani, Mohsen, 2011. "A game theoretic approach to coordinate pricing and vertical co-op advertising in manufacturer-retailer supply chains," European Journal of Operational Research, Elsevier, vol. 211(2), pages 263-273, June.
    17. Leng, Mingming & Zhu, An, 2009. "Side-payment contracts in two-person nonzero-sum supply chain games: Review, discussion and applications," European Journal of Operational Research, Elsevier, vol. 196(2), pages 600-618, July.
    18. Mazalov, Vladimir & Tokareva, Julia, 2012. "Arbitration procedures with multiple arbitrators," European Journal of Operational Research, Elsevier, vol. 217(1), pages 198-203.
    19. Li, Deng-Feng, 2011. "Linear programming approach to solve interval-valued matrix games," Omega, Elsevier, vol. 39(6), pages 655-666, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:223:y:2012:i:2:p:421-429. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.