Advanced search
1 file | 215.81 KB

Optimal strategies for symmetric matrix games with partitions

Author
Organization
Abstract
We introduce three variants of a symmetric matrix game corresponding to three ways of comparing two partitions of a fixed integer (sigma) into a fixed number (n) of parts, In the random variable interpretation of the game, each variant depends on the choice of a copula that binds the marginal uniform cumulative distribution functions (cdf) into the bivariate cdf. The three copulas considered are the product copula T-P and the two extreme copulas, i.e. the minimum Copula T-M and the Lukasiewicz copula T-L. The associated games are denoted as the (n, sigma)(P), (n, sigma)(M)and (n, sigma)(L) games. In the present paper, we characterize the optimal strategies of the (n, sigma)(M) and (n, sigma)(L) games and compare them to the optimal strategies of the (n, sigma)(P) games. It turns out that the characterization of the optimal strategies is completely different for each game variant.
Keywords
Partition theory, Optimal strategy, Matrix game, Probabilistic relation, Copula

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 215.81 KB

Citation

Please use this url to cite or link to this publication:

Chicago
De Schuymer, Bart, Hans De Meyer, and Bernard De Baets. 2009. “Optimal Strategies for Symmetric Matrix Games with Partitions.” Bulletin of the Belgian Mathematical Society-simon Stevin 16 (1): 67–89.
APA
De Schuymer, B., De Meyer, H., & De Baets, B. (2009). Optimal strategies for symmetric matrix games with partitions. BULLETIN OF THE BELGIAN MATHEMATICAL SOCIETY-SIMON STEVIN, 16(1), 67–89.
Vancouver
1.
De Schuymer B, De Meyer H, De Baets B. Optimal strategies for symmetric matrix games with partitions. BULLETIN OF THE BELGIAN MATHEMATICAL SOCIETY-SIMON STEVIN. 2009;16(1):67–89.
MLA
De Schuymer, Bart, Hans De Meyer, and Bernard De Baets. “Optimal Strategies for Symmetric Matrix Games with Partitions.” BULLETIN OF THE BELGIAN MATHEMATICAL SOCIETY-SIMON STEVIN 16.1 (2009): 67–89. Print.
@article{693922,
  abstract     = {We introduce three variants of a symmetric matrix game corresponding to three ways of comparing two partitions of a fixed integer (sigma) into a fixed number (n) of parts, In the random variable interpretation of the game, each variant depends on the choice of a copula that binds the marginal uniform cumulative distribution functions (cdf) into the bivariate cdf. The three copulas considered are the product copula T-P and the two extreme copulas, i.e. the minimum Copula T-M and the Lukasiewicz copula T-L. The associated games are denoted as the (n, sigma)(P), (n, sigma)(M)and (n, sigma)(L) games. In the present paper, we characterize the optimal strategies of the (n, sigma)(M) and (n, sigma)(L) games and compare them to the optimal strategies of the (n, sigma)(P) games. It turns out that the characterization of the optimal strategies is completely different for each game variant.},
  author       = {De Schuymer, Bart and De Meyer, Hans and De Baets, Bernard},
  issn         = {1370-1444},
  journal      = {BULLETIN OF THE BELGIAN MATHEMATICAL SOCIETY-SIMON STEVIN},
  language     = {eng},
  number       = {1},
  pages        = {67--89},
  title        = {Optimal strategies for symmetric matrix games with partitions},
  volume       = {16},
  year         = {2009},
}

Web of Science
Times cited: