A Mixture of “Cheats” and “Co-Operators” Can Enable Maximal Group Benefit

نویسندگان

  • R. Craig MacLean
  • Ayari Fuentes-Hernandez
  • Duncan Greig
  • Laurence D. Hurst
  • Ivana Gudelj
چکیده

Is a group best off if everyone co-operates? Theory often considers this to be so (e.g. the "conspiracy of doves"), this understanding underpinning social and economic policy. We observe, however, that after competition between "cheat" and "co-operator" strains of yeast, population fitness is maximized under co-existence. To address whether this might just be a peculiarity of our experimental system or a result with broader applicability, we assemble, benchmark, dissect, and test a systems model. This reveals the conditions necessary to recover the unexpected result. These are 3-fold: (a) that resources are used inefficiently when they are abundant, (b) that the amount of co-operation needed cannot be accurately assessed, and (c) the population is structured, such that co-operators receive more of the resource than the cheats. Relaxing any of the assumptions can lead to population fitness being maximized when cheats are absent, which we experimentally demonstrate. These three conditions will often be relevant, and hence in order to understand the trajectory of social interactions, understanding the dynamics of the efficiency of resource utilization and accuracy of information will be necessary.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Upside of Slackers

Are slackers a drag on the rest of us? It makes sense because those who produce (‘‘co-operators’’) benefit everyone, whereas those who don’t produce (‘‘cheats’’) get a free ride. In yeast, for instance, most strains are co-operators, secreting an enzyme called invertase that converts sucrose into the more efficiently metabolized glucose. However, about a tenth of strains are cheats that do not ...

متن کامل

A Proximal Point Algorithm for Finding a Common Zero of a Finite Family of Maximal Monotone Operators

In this paper, we consider a proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in real Hilbert spaces. Also, we give a necessary and sufficient condition for the common zero set of finite operators to be nonempty, and by showing that in this case, this iterative sequence converges strongly to the metric projection of some point onto the set of c...

متن کامل

Sum Formula for Maximal Abstract Monotonicity and Abstract Rockafellar’s Surjectivity Theorem

In this paper, we present an example in which the sum of two maximal abstract monotone operators is maximal. Also, we shall show that the necessary condition for Rockafellar’s surjectivity which was obtained in ([19], Theorem 4.3) can be sufficient.

متن کامل

Common Zero Points of Two Finite Families of Maximal Monotone Operators via Proximal Point Algorithms

In this work, it is presented iterative schemes for achieving to common points of the solutions set of the system of generalized mixed equilibrium problems, solutions set of the variational inequality for an inverse-strongly monotone operator, common fixed points set of two infinite sequences of relatively nonexpansive mappings and common zero points set of two finite sequences of maximal monot...

متن کامل

Failure Mode and Effects Analysis Using Generalized Mixture Operators

Failure mode and effects analysis (FMEA) is a method based on teamwork to identify potential failures and problems in a system, design, process and service in order to remove them. The important part of this method is determining the risk priorities of failure modes using the risk priority number (RPN). However, this traditional RPN method has several shortcomings. Therefore, in this paper we p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2010