论文信息 - Lattice Structure and Convergence of a Game of Cards

Lattice Structure and Convergence of a Game of Cards

Abstract. We study the dynamics of the so-called Game of Cards by using tools developed in the context of discrete dynamical systems. We extend a result of [4] and [10] (the last one in the context of distributed systems) that established a necessary and sufficient condition for the game to converge. We precisely describe the lattice structure of the set of configurations and we state bounds for the convergence time.

[1] Eric Goles Ch.,et al. Games on Line Graphs and Sand Piles , 1993, Theor. Comput. Sci..

[2] Ekkart Kindler,et al. A Simplified Proof for a Self-Stabilizing Protocol: A Game of Cards , 1995, Inf. Process. Lett..

[3] Shing-Tsaan Huang,et al. Leader election in uniform rings , 1993, TOPL.

[4] Ha Duong Phan,et al. About the Dynamics of Some Systems Based on Integer Partitions and Compositions , 2000 .

[5] Daniel J. Kleitman,et al. Longest Chains in the Lattice of Integer Partitions ordered by Majorization , 1986, Eur. J. Comb..

[6] Thomas Brylawski,et al. The lattice of integer partitions , 1973, Discret. Math..

[7] Eric Goles Ch.,et al. Sandpiles and order structure of integer partitions , 2002, Discret. Appl. Math..

[8] Matthieu Latapy,et al. The lattice structure of chip firing games and related models , 2000 .

[9] Brian A. Davey,et al. An Introduction to Lattices and Order , 1989 .