A class of two-person zero-sum matrix games with rough payoffs (Q978991): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q58651765, #quickstatements; #temporary_batch_1704605156744
Property / Wikidata QID
 
Property / Wikidata QID: Q58651765 / rank
 
Normal rank

Revision as of 07:27, 7 January 2024

scientific article
Language Label Description Also known as
English
A class of two-person zero-sum matrix games with rough payoffs
scientific article

    Statements

    A class of two-person zero-sum matrix games with rough payoffs (English)
    0 references
    0 references
    0 references
    0 references
    25 June 2010
    0 references
    Summary: We concentrate on discussing a class of two-person zero-sum games with rough payoffs. Based on the expected value operator and the trust measure of rough variables, the expected equilibrium strategy and \(r\)-trust maximin equilibrium strategy are defined. Five cases whether the game exists \(r\)-trust maximin equilibrium strategy are discussed, and the technique of genetic algorithm is applied to find the equilibrium strategies. Finally, a numerical example is provided to illustrate the practicality and effectiveness of the proposed technique.
    0 references
    0 references
    0 references