Regret-minimizing strategies for repeated games have been receiving increasing attention in the literature. These are simple adaptive behavior rules that lead to no regrets and, if followed by all players, exhibit nice convergence properties: the average play converges to correlated equilibrium,...

We consider a multi-period auction with a seller who has a single object for sale, a large population of potential buyers, and a mediator of the trade. The seller and every buyer have independent private values of the object. The mediator designs an auction mechanism which maximizes her revenue...

Potential based no-regret dynamics are shown to be related to fictitious play. Roughly, these are epsilon-best reply dynamics where epsilon is the maximal regret, which vanishes with time. This allows for alternative and sometimes much shorter proofs of known results on convergence of no-regret...

The costs of searching for a job vacancy are typically associated with friction that deters or delays employment of potentially productive individuals. We demonstrate that in a labor market with moral hazard where effort is noncontractible, job search costs play a positive role, whose effect may...

The paper addresses the mechanism design problem of eliciting truthful information from a committee of informed experts who collude in their information disclosure strategies. It is shown that under fairly general conditions full information disclosure is possible if and only if the induced...

Potential based no-regret dynamics are shown to be related to fictitious play. Roughly, these are ε-best reply dynamics where ε is the maximal regret, which vanishes with time. This allows for alternative and sometimes much shorter proofs of known results on convergence of no-regret dynamics...