اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCooperation amongst competing agents in minority games
70
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study a variation of the minority game. There are N agents. Each has to choose between one of two alternatives everyday, and there is reward to each member of the smaller group. The agents cannot communicate with each other, but try to guess the choice others will make, based only the past history of number of people choosing the two alternatives. We describe a simple probabilistic strategy using which the agents acting independently, can still maximize the average number of people benefitting every day. The strategy leads to a very efficient utilization of resources, and the average deviation from the maximum possible can be made of order $(N^{epsilon})$, for any $epsilon >0$. We also show that a single agent does not expect to gain by not following the strategy.
قيم البحث
اقرأ أيضاً
We present a comprehensive study of utility function of the minority game in its efficient regime. We develop an effective description of state of the game. For the payoff function $g(x)=sgn (x)$ we explicitly represent the game as the Markov process
and prove the finitness of number of states. We also demonstrate boundedness of the utility function. Using these facts we can explain all interesting observable features of the aggregated demand: appearance of strong fluctuations, their periodicity and existence of prefered levels. For another payoff, $g(x)=x$, the number of states is still finite and utility remains bounded but the number of states cannot be reduced and probabilities of states are not calculated. However, using properties of the utility and analysing the game in terms of de Bruijn graphs, we can also explain distinct peaks of demand and their frequencies.
We discuss the strategy that rational agents can use to maximize their expected long-term payoff in the co-action minority game. We argue that the agents will try to get into a cyclic state, where each of the $(2N +1)$ agent wins exactly $N$ times in
any continuous stretch of $(2N+1)$ days. We propose and analyse a strategy for reaching such a cyclic state quickly, when any direct communication between agents is not allowed, and only the publicly available common information is the record of total number of people choosing the first restaurant in the past. We determine exactly the average time required to reach the periodic state for this strategy. We show that it varies as $(N/ln 2) [1 + alpha cos (2 pi log_2 N)$], for large $N$, where the amplitude $alpha$ of the leading term in the log-periodic oscillations is found be $frac{8 pi^2}{(ln 2)^2} exp{(- 2 pi^2/ln 2)} approx {color{blue}7 times 10^{-11}}$.
Generalization of the minority game to more than one market is considered. At each time step every agent chooses one of its strategies and acts on the market related to this strategy. If the payoff function allows for strong fluctuation of utility th
en market occupancies become inhomogeneous with preference given to this market where the fluctuation occured first. There exists a critical size of agent population above which agents on bigger market behave collectively. In this regime there always exists a history of decisions for which all agents on a bigger market react identically.
In this Brief Report we study the evolutionary dynamics of the Public Goods Game in a population of mobile agents embedded in a 2-dimensional space. In this framework, the backbone of interactions between agents changes in time, allowing us to study
the impact that mobility has on the emergence of cooperation in structured populations. We compare our results with a static case in which agents interact on top of a Random Geometric Graph. Our results point out that a low degree of mobility enhances the onset of cooperation in the system while a moderate velocity favors the fixation of the full-cooperative state.
Cooperative interactions pervade the dynamics of a broad rage of many-body systems, such as ecological communities, the organization of social structures, and economic webs. In this work, we investigate the dynamics of a simple population model that
is driven by cooperative and symmetric interactions between two species. We develop a mean-field and a stochastic description for this cooperative two-species reaction scheme. For an isolated population, we determine the probability to reach a state of fixation, where only one species survives, as a function of the initial concentrations of the two species. We also determine the time to reach the fixation state. When each species can migrate into the population and replace a randomly selected individual, the population reaches a steady state. We show that this steady-state distribution undergoes a unimodal to trimodal transition as the migration rate is decreased beyond a critical value. In this low-migration regime, the steady state is not truly steady, but instead fluctuates strongly between near-fixation states of the two species. The characteristic time scale of these fluctuations diverges as $lambda^{-1}$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
