2 resultados para Information agents

em Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco


Relevância:

30.00% 30.00%

Publicador:

Resumo:

Differently from previous studies of tag-based cooperation, we assume that individuals fail to recognize their own tag. Due to such incomplete information, the action taken against the opponent cannot be based on similarity, although it is still motivated by the tag displayed by the opponent. We present stability conditions for the case when individuals play unconditional cooperation, unconditional defection or conditional cooperation. We then consider the removal of one or two strategies. Results show that conditional cooperators are the most resilient agents against extinction and that the removal of unconditional cooperators may lead to the extinction of unconditional defectors.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

In everyday economic interactions, it is not clear whether sequential choices are visible or not to other participants: agents might be deluded about opponents'capacity to acquire,interpret or keep track of data, or might simply unexpectedly forget what they previously observed (but not chose). Following this idea, this paper drops the assumption that the information structure of extensive-form games is commonly known; that is, it introduces uncertainty into players' capacity to observe each others' past choices. Using this approach, our main result provides the following epistemic characterisation: if players (i) are rational,(ii) have strong belief in both opponents' rationality and opponents' capacity to observe others' choices, and (iii) have common belief in both opponents' future rationality and op-ponents' future capacity to observe others' choices, then the backward induction outcome obtains. Consequently, we do not require perfect information, and players observing each others' choices is often irrelevant from a strategic point of view. The analysis extends {from generic games with perfect information to games with not necessarily perfect information{the work by Battigalli and Siniscalchi (2002) and Perea (2014), who provide different sufficient epistemic conditions for the backward induction outcome.