Title: "A Central Limit Theorem for intransitive dice"

Speaker: Daniel Ungaretti

Abstract: Consider dice that are allowed to have different numbers of faces and any number on each face. Die A is said to be better than die B, denoted A ▷ B, if it has a larger probability of winning. This ordering of dice is not transitive: it is possible that A ▷ B ▷ C ▷ A. In this talk we present results on the probability of random dice (with i.i.d. faces) forming an intransitive chain, as the number of faces of each die goes to infinity. We prove a Central Limit Theorem for such dice, combining the method of moments with simple graph theory arguments.

March 25, from 3:30 p.m. to 4:30 p.m. (Rio de Janeiro local time).

Local: room C116 - Bloco C - CT – Instituto de Matemática – UFRJ.

More complete information about the seminars can be found HERE.

Sincerely,
Organizers: Giulio Iacobelli and Maria Eulalia Vares