A class of two-person zero-sum matrix games with rough payoffs (Q978991)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A class of two-person zero-sum matrix games with rough payoffs |
scientific article; zbMATH DE number 5726440
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A class of two-person zero-sum matrix games with rough payoffs |
scientific article; zbMATH DE number 5726440 |
Statements
A class of two-person zero-sum matrix games with rough payoffs (English)
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
0.8295990824699402
0 references
0.8164829611778259
0 references
0.8142542243003845
0 references
0.7900816202163696
0 references