We consider small-influence anonymous games with a large number of players $n$ where every player has two actions. For this class of games we present a best-reply dynamic with the following two properties. First, the dynamic reaches Nash approximate equilibria fast (in at most $cn\ log n$ steps...

In two experiments, we explored how the perspective through which individuals view their decisions influences their moral behavior. To do this we employed a computerized “Is that the answer you had in mind?” trivial-pursuit style game. The game challenges individuals’ integrity because...

We quantified the effect of first experience on behavior in operant learning and studied its underlying computational principles. To that goal, we analyzed more than 200,000 choices in a repeated-choice experiment. We found that the outcome of the first experience has a substantial and lasting...

We study conditions relating to the impossibility of agreeing to disagree in models of interactive KD45 belief (in contrast to models of S5 knowledge, which are used in nearly all the agreements literature). Agreement and disagreement are studied under models of belief in three broad settings:...

The problem of disagreement asks about the appropriate response (typically the response of a peer) upon encountering a disagreement between peers. The responses proposed in the literature offer different solutions to the problem, each of which has more or less normative appeal. Yet none of these...

Are good people motivated to behave in accordance the moral truth whatever it is? Michael Smith, who has named this motivation the de-dicto moral motivation, famously criticized it. According to Smith, good people are instead motivated directly by more concrete moral concerns, such as “the...

For a random permutation π on {1,2,…,n} for fixed n, and for M⊆{1,2,…,n}, we analyse the distribution of the combined length L=L(π,M) of all cycles of π that contain at least one element of M. We give a simple, explicit formula for the probability of every possible value for L (backed...

We add two results to the theory of consistent voting. Let M be the set of all survivors of some feasible elimination procedure. We prove that i) M can be computed in polynomial time for each profile of preferences and ii) M is characterized by anonymity, non- imposition, Maskin monotonicity,...

The logic of backward induction (BI) in perfect information (PI) games has been intensely scrutinized for the past quarter century. A major development came in 2002, when P. Battigalli and M. Sinischalchi (BS) showed that an outcome of a PI game is consistent with common strong belief of utility...

Recent research in psychology, especially that called "The New Unconscious", is discovering strange and unintuitive phenomena, some of which raise interesting challenges for the law. This paper discusses some of these challenges. For example, if much of our mental life occurs out of our...