نتایج جستجو برای: basic cooperation graph
تعداد نتایج: 516274 فیلتر نتایج به سال:
The production of iron-scavenging siderophores by the opportunistic animal pathogen Pseudomonas aeruginosa is a textbook example of public goods cooperation. This trait provides an excellent model system with which to study cooperation. Further, the links between siderophore production and P. aeruginosa virulence allow us to investigate how pathogen ecology, social behaviour and pathology might...
One way to model the social network is to use simplicial complex, where we use a simplex to model cooperation, so a simplex of 3 people is different from 3 pairs in a graph representation of the social graph. Given two simplicial complexes, we want to be able to compare them and tell which one is better, one way to do this is to compare the face vector of these two simplicial complex, however i...
The promise of multi-agent systems is that multiple agents can solve problems more efficiently than single agents can. In this paper we propose a method to implement cooperation between agents in the planning phase, in order to achieve more cost-effective solutions than without cooperation. Two results are presented: First of all, we introduce a flexible framework to describe cooperation in a p...
The evolution of cooperative behavior is one of the most important issues in game theory. Previous studies have shown that cooperation can evolve only under highly limited conditions, and various modifications have been introduced to games to explain the evolution of cooperation. Recently, a utility function basic to game theory was shown to be dependent on current wealth as a conditional (stat...
We present a decentralized cooperative exploration strategy for mobile robots. A roadmap of the explored area, with the associate safe region, is built in the form of a compact data structure, called Sensor-based Random Graph. This is incrementally expanded by the robots by using a randomized local planner which automatically realizes a trade-off between information gain and navigation cost. Co...
We study the evolution of cooperation modeled as symmetric 2x2 games in a population whose structure is split into an interaction graph defining who plays with whom and a replacement graph specifying evolutionary competition. We find it is always harder for cooperators to evolve whenever the two graphs do not coincide. In the thermodynamic limit, the dynamics on both graphs is given by a replic...
The game of Col is a two-player mapcoloring game invented by Colin Vout where to establish who has a winning strategy on a general graph is a PSPACE-complete problem. However, winning strategies can be found on specific graph instances, e.g., k-ary complete trees. Three-player Col is a threeplayer version of Col. Because of the possibility to form alliances, cooperation between players is a key...
Our results suggest that human specialized capacity for commitment, which might have been shaped by natural selection, consists in a capacity for managing to impose a high cost of punishment at a relatively small cost. References. [1] Nesse. Evolution and the Capacity for Commitment. Russell Sage Foundation, 2001. [2] Axelrod. The Evolution of Cooperation. Basic Books, 1984. [3] Han.et.al. Inte...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید