Titlebook: Simulating Social Phenomena; Rosaria Conte,Rainer Hegselmann,Pietro Terna Conference proceedings 1997 Springer-Verlag Berlin Heidelberg 19

COKE

Bargaining Between Automatas. But the rationality requirements of the subgame-perfect equilibrium concept are too severe for this celebrated result of Ariel Rubinstein [21] to be relevant to the design of automated agents capable of negotiating on behalf of their clients. This paper therefore studies the play of bargaining games with alternating offers by finite automata.

prostatitis

Spatially Coevolving Automata Play the Repeated Prisoner’s Dilemmalts across two experimental setups. The first concerns a genetic algorithm that evolves a population of repeated prisoner’s dilemma (RPD) strategies (.. Miller 1988). The second concerns localized adaptation in a decentralized population of agents . strategies.

HALO

A Spatial Iterated Prisoners Dilemma Game Simulation With Movementment. Simulation analyses indicate that the introduction of actor movement increases levels of cooperation. When stable cooperative worlds occur, they are generated by the formation of large networks of cooperative actors.

袋鼠

Kidnap

Cooperation Without Memorylities and (2) that memory for past interactions is not necessary to maintain a stable system of cooperation; the ability to assess a competitor’s fighting ability is sufficient. The strategies of our agents are based solely on their own fighting ability and cues of the fighting strength of other agents.

领导权

Tributes or Norms? The Context-dependent Rationality of Social Controlations living in condition of resource scarcity are compared. Simulation results suggest that there is no unconditionally optimal strategy, and that social control cannot be reduced to successful intimidation.

衰弱的心

AWRY

态度暖昧

Pietro Ternaeal. CA. The CRM Series in Mathematical Physics includes mono­ graphs, lecture notes, and proceedings based on research pur­ sued and on events held at the CRM. Yvan Saint-Aubin Montreal Preface This monograph is derived from a series of six lectures which were given at the Centre de recherches math

Infuriate

Erhard Bruderer,Martin Maiersvel mixture of timed automata and GSMCs. We show that GSMCs are a proper subset of stochastic automata, discuss various notions of equivalence, present congruence results, treat equational reasoning, and argue how an expansion law in the process algebra can be obtained. As a case study, we specify t