This paper studies repeated implementation of social choice functions in environments with complete information and changing preferences. We introduce the condition of dynamic monotonicity and show that it is necessary for repeated implementation in finite as well as infinite horizon problems....

We study decentralized learning in organizations. Decentralization is captured through a symmetry constraint on agents' strategies. Among such attainable strategies, we solve for optimal and equilibrium strategies. We model the organization as a repeated game with imperfectly observable actions....

In this paper we investigate how cognitive ability and character skills influence behavior, success and the evolution of play towards Nash equilibrium in repeated strategic interactions. We study behavior in a p-beauty contest experiment and find striking differences according to cognitive...

We examine the novel concept for repeated noncooperative games with bounded rationality: "Nash-2" equilibrium, called also "threatening-proof profile" in [16, Iskakov M., Iskakov A., 2012b]. It is weaker than Nash equilibrium and equilibrium in secure strategies: a player takes into account not...

There is a widespread hope that, in the near future, algorithms become so sophisticated that ``solutions" to most problems are found by machines. In this note, we throw some doubts on this expectation by showing the following impossibility result: given a set of finite-memory, finite-iteration...

In this paper we investigate how cognitive ability and character skills influence behavior, success and the evolution of play towards Nash equilibrium in repeated strategic interactions. We study behavior in a p-beauty contest experiment and find striking differences according to cognitive...

A learning rule is uncoupled if a player does not condition his strategy on the opponent's payoffs. It is radically uncoupled if a player does not condition his strategy on the opponent's actions or payoffs. We demonstrate a family of simple, radically uncoupled learning rules whose...

We study two-player discounted repeated games in which one player cannot monitor the other unless he pays a fixed amount. It is well known that in such a model the folk theorem holds when the monitoring cost is on the order of magnitude of the stage payoff. We analyze high frequency games in...