From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader

A class of games for finding a leader among a group of candidates is studied in detail. This class covers games based on coin-tossing and rock-paper-scissors as special cases and its complexity exhibits similar stochastic behaviors: either of logarithmic mean and bounded variance or of exponential mean and exponential variance. Many applications are also discussed.

[1]  G. Szabó,et al.  Evolutionary games on graphs , 2006, cond-mat/0607344.

[2]  Herbert S. Winokur,et al.  Exact Moments of the Order Statistics of the Geometric Distribution and Their Relation to Inverse Sampling and Reliability of Redundant Systems , 1967 .

[3]  P. Flajolet,et al.  Analytic Combinatorics: RANDOM STRUCTURES , 2009 .

[4]  G. Weiss.  On Certain Redundant Systems which Operate at Discrete Times , 1962 .

[5]  Hsien-Kuei Hwang,et al.  Analysis in distribution of two randomized algorithms for finding the maximum in a broadcast communication model , 2003, J. Algorithms.

[6]  On the Maximum and Its Uniqueness for Geometric Random Samples , 1990 .

[7]  B. Eisenberg.  On the expectation of the maximum of IID geometric random variables , 2008 .

[8]  Adrienne W. Kemp.  Bulk Buying of Possibly Defective Items , 1984 .

[9]  A. Gnedin.  Regeneration in random combinatorial structures , 2009, 0901.4444.

[10]  Vernon Rego,et al.  Exploiting Parallelism Across Program Execution: A Unification Technique and Its Analysis , 1990, IEEE Trans. Parallel Distributed Syst..

[11]  Wojciech Szpankowski,et al.  Yet another application of a binomial recurrence order statistics , 1990, Computing.

[12]  Boltzmann Equation on Some Algebraic Structure Concerning Struggle for Existence , 1971 .

[13]  Philippe Flajolet,et al.  Mellin Transforms and Asymptotics: Harmonic Sums , 1995, Theor. Comput. Sci..

[14]  J. G. Wendel.  A Problem in Geometric Probability. , 1962 .

[15]  Helmut Prodinger,et al.  How to select a loser , 1993, Discret. Math..

[17]  B. Sinervo,et al.  The rock–paper–scissors game and the evolution of alternative male strategies , 1996, Nature.

[18]  D. R. Hush,et al.  Analysis of tree algorithms for RFID arbitration , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[19]  H. Mahmoud,et al.  Perpetuities in Fair Leader Election Algorithms , 2014, Advances in Applied Probability.

[20]  Kei-ichi Tainaka,et al.  Lattice Model for the Lotka-Volterra System , 1988 .

[21]  P. Flajolet,et al.  Digital Trees and Memoryless Sources: from Arithmetics to Analysis , 2010 .

[22]  Bo Lundberg.  Fatigue Life of Airplane Structures The Eighteenth Wright Brothers Lecture , 1955 .

[23]  Erwin Frey,et al.  Coexistence and survival in conservative Lotka-Volterra networks. , 2013, Physical review letters.

[24]  Y. Itoh.  Integrals of a Lotka-Volterra System of Odd Number of Variables , 1987 .

[25]  Oriented graphs generated by random points on a circle , 2000 .

[26]  Yoshiaki Itoh,et al.  A Binomial Splitting Process in Connection with Corner Parking Problems , 2014, J. Appl. Probab..

[27]  Svante Janson,et al.  Analysis of an Asymmetric Leader Election Algorithm , 1997, Electron. J. Comb..

[28]  H. Maehara,et al.  On the waiting time in a janken game , 2000 .

[29]  Philippe Flajolet,et al.  Analytic Combinatorics , 2009 .

[30]  Hsien-Kuei Hwang,et al.  An analytic approach to the asymptotic variance of trie statistics and related structures , 2013, Theor. Comput. Sci..

[31]  L. Devroye.  A Limit Theory for Random Skip Lists , 1992 .

[32]  K Sigmund,et al.  The theory of evolution and dynamic systems mathematical aspects of selection , 1984 .

[33]  J M Smith,et al.  Evolution and the theory of games , 1976 .

[34]  Y. Itoh.  An $H$-theorem for a system of competing species , 1975 .

[35]  W. Szpankowski,et al.  Yet Another Application of a Binomial Recurrence , 1988 .

[36]  D. E. Matthews.  Evolution and the Theory of Games , 1977 .

[37]  Philippe Jacquet,et al.  Analytical Depoissonization and its Applications , 1998, Theor. Comput. Sci..

[38]  Micha Hofri,et al.  On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel , 1986 .

[39]  Hsien-Kuei Hwang,et al.  Asymptotic variance of random symmetric digital search trees , 2009, Discret. Math. Theor. Comput. Sci..

[40]  P. Krapivsky,et al.  Fixation in a cyclic Lotka-Volterra model , 1998, cond-mat/9801026.

[41]  John Capetanakis,et al.  Tree algorithms for packet broadcast channels , 1979, IEEE Trans. Inf. Theory.

[42]  Probability, Defectives and Mail Ordering , 1981 .

[43]  Wojciech Szpankowski,et al.  On the distribution for the duration of a randomized leader election algorithm , 1996 .

[44]  O. Bogoyavlensky.  Integrable discretizations of the KdV equation , 1988 .

[45]  Stephan Olariu,et al.  Randomized initialization protocols for radio networks , 2002 .

[46]  Jotun Hein,et al.  Statistical Methods in Bioinformatics: An Introduction , 2002 .

[47]  L. Rüschendorf,et al.  A general limit theorem for recursive algorithms and combinatorial structures , 2004 .