E Ben-Naim et al J. Stat. Mech. (2006) P07001 doi:10.1088/1742-5468/2006/07/P07001
E Ben-Naim1, B Kahng1,2 and J S Kim1,2
Show affiliationsWe analyse the dynamics of competitions with a large number of players. In our model, n players compete against each other and the winner is decided based on the standings: in each competition, the mth ranked player wins. We solve for the long time limit of the distribution of the number of wins for all n and m using scaling analysis of the nonlinear evolution equations, and find three different scenarios. When the best player wins, the standings are most competitive as there is one tier with a clear differentiation between strong and weak players. When an intermediate player wins, the standings are two-tier with equally strong players in the top tier and clearly-separated players in the lower tier. Interestingly, the size and the strength of the upper tier are nontrivial. When the worst player wins, the standings are least competitive as there is one tier in which all of the players are equal. We conclude that controlling the rank of the winner provides a way of controlling social inequalities.
02.50.Le Decision theory and game theory
Issue 07 (July 2006)
Received 28 April 2006, accepted for publication 15 June 2006
Published 11 July 2006
E Ben-Naim et al J. Stat. Mech. (2006) P07001
Miquel Montero J. Stat. Mech. (2007) P04002
John Ardelius et al J. Stat. Mech. (2007) P10012
Iwan Jensen J. Stat. Mech. (2004) P10008
R-D Herzberg et al 2006 Phys. Scr. 2006 73
Joachim Krug J. Stat. Mech. (2007) P07001
J C Woicik et al 2005 Phys. Scr. 2005 620
Miloslav Znojil 2008 J. Phys. A: Math. Theor. 41 215304
Mariano A Zimmler et al 2007 Nanotechnology 18 235205
Bojko Bakalov et al 2008 J. Phys. A: Math. Theor. 41 194002