Optimal strategies for equal-sum dice games

DOI10.1016/j.dam.2006.04.024zbMath1255.91009OpenAlexW2016385589WikidataQ60258193 ScholiaQ60258193MaRDI QIDQ858306

Bernard De Baets, H. E. De Meyer, Bart de Schuymer

Publication date: 9 January 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.04.024

zbMATH Keywords

partitionsoptimal strategynon-cooperative gamedice gamezero-sum matrix game

Mathematics Subject Classification ID

Noncooperative games (91A10) 2-person games (91A05)

Related Items (4)

A Colonel Blotto Gladiator Game ⋮ On the cycle-transitivity of the mutual rank probability relation of a poset ⋮ A Game of Nontransitive Dice ⋮ Learning intransitive reciprocal relations with kernel methods

Cites Work

• Identities in combinatorics. III: Further aspects of ordered set sorting
• Binary choice probabilities: on the varieties of stochastic transitivity
• On the cycle-transitivity of the dice model
• Cyclic evaluation of transitivity of reciprocal relations
• Cycle-transitive comparison of independent random variables
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal strategies for equal-sum dice games