Consider the problem of information disclosure for a planner who faces two agents interacting in a state-dependent multi-action prisoners' dilemma. We find conditions under which the planner can make use of his superior information by disclosing some of it to the agents, and conditions under...

We study a strategic model of dynamic trading where agents are asymmetrically informed over common value sources of uncertainty. There is a continuum of buyers and a finite number n of sellers. All buyers are uninformed, while at least one seller is privately informed about the true state of the...

Consider the problem of information disclosure for a planner who faces two agents interacting in a state-dependent multi-action prisoners' dilemma. We find conditions under which the planner can make use of his superior information by disclosing some of it to the agents, and conditions under...

In contexts in which players have no priors, we analyze a learning process based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are...

We consider the regret matching process with finite memory. For general games in normal form, it is shown that any recurrent class of the dynamics must be such that the action profiles that appear in it constitute a closed set under the 'same or better reply' correspondence (CUSOBR set) that...

We study a strategic model of dynamic trading where agents are asymmetrically informed over common value sources of uncertainty. There is a continuum of uninformed buyers and a finite number of sellers, some of them informed. When there is only one seller, full information revelation never...

In contexts in which players have no priors, we analyze a learning process based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are...

We consider the regret matching process with finite memory. For general games in normal form, it is shown that any recurrent class of the dynamics must be such that the action profiles that appear in it constitute a closed set under the “same or better reply” correspondence (CUSOBR set) that...

We study a strategic model of dynamic trading where agents are asymmetrically informed over common value sources of uncertainty. There is a continuum of uninformed buyers and a finite number of sellers, some of them informed. When there is only one seller, full information revelation never...