This article argues that the agent‐based computational model permits a distinctive approach
to social science for which the term “generative” is suitable. In defending this terminology …

We study the complexity of rules by paying experimental subjects to implement a series of
algorithms and then eliciting their willingness-to-pay to avoid implementing them again in …

Wir haben die Möglichkeit einer weiteren Auflage des Buches genutzt, den Text
leserfreundlicher zu gestalten, den Sach-und Personenindex zu überarbeiten und neuere …

The theory of repeated games is concerned with the analysis of behavior in long-term
interactions as opposed to one-shot situations; in this framework new objects occur in the …

A hilariously funny cookbook–cum–how–I–did–it memoir by the chef/restaurateur who
created New York's dazzling Ápizz restaurant. At the age of thirty–seven, John LaFemina left …

Nash equilibrium has been tremendously useful in understanding economic problems in
which strategic behavior is important. The theoretical foundations of the solution concept …

Within the class of memory-one strategies for the iterated Prisoner's Dilemma, we
characterize partner strategies, competitive strategies and zero-determinant strategies. If a …

This paper concerns a decision problem of an agent, searching to find a low price, whose
memory is represented by a partition of the set of possible past prices. The number of …

We develop a general game-theoretic framework for reasoning about strategic agents
performing possibly costly computation. In this framework, many traditional game-theoretic …

Dieser Aufsatz geht der von Harald Müller (1994) aufgeworfenen Frage nach, ob
Kommunikation innerhalb des Rational-Choice-Ansatzes selbst konzeptualisiert werden …