Title
The majority and minority models on regular and random graphs
Abstract
In the two strategy majority/minority game on a network, at time t, an individual observes some subset of its neighbors strategies, and then adopts at time t+1 that strategy which was more/less frequently played by its neighbors at time t. We shall examine in this paper a variety of distinct models which vary the subsets observed, the synchrony of actions, the regularity, or otherwise, of the networks, the mix of majority and minority players. Important measures of the dynamics of such systems such as the nature of the fixed points, and limit cycles are discussed. The expected payoffs under certain games are computed and compared. In particular we shall examine complete networks, hypercubes and a certain class of cubic networks. These graphs have rather different numbers of symmetries which impact on the properties of the dynamics. The work is of an exploratory nature and hopefully will suggest many potential lines of enquiry.
Year
DOI
Venue
2009
10.1109/GAMENETS.2009.5137464
GAMENETS
Keywords
Field
DocType
strategy majority,hypercubes,minority game,neighbors strategy,cubic network,minority player,complete network,game theory,certain game,regular graph,graph theory,minority model,majority game,certain class,random graph,different number,exploratory nature,data mining,games,world wide web,probability density function,complex networks,limit cycle,stochastic processes,self assembly,fixed point,time frequency analysis,sociology,robustness
Graph theory,Discrete mathematics,Random graph,Stochastic process,Regular graph,Game theory,Complex network,Fixed point,Mathematics,Hypercube
Conference
ISBN
Citations 
PageRank 
978-1-4244-4177-8
2
0.39
References 
Authors
0
1
Name
Order
Citations
PageRank
Chris Cannings1374.96