We consider an agent who has to repeatedly make choices in an uncertain and changing environment, who has full information of the past, who discounts future payoffs, but who has no prior. We provide a learning algorithm that performs almost as well as the best of a given finite number of experts...

We present an exact test for whether two random variables that have known bounds on their support are negatively correlated. The alternative hypothesis is that they are not negatively correlated. No assumptions are made on the underlying distributions. We show by example that the Spearman rank...

We run an experiment in which two subjects play a two-round minimum effort game in the presence of a third player (principal) who is the only one informed about past effort choices and benefits from a higher minimum effort of the others. Sanctions introduced in the second round by the...

We introduce several exact nonparametric tests for finite sample multivariate linear regressions, and compare their powers. This fills an important gap in the literature where the only known nonparametric tests are either asymptotic, or assume one covariate only.

Scoring rules that elicit an entire belief distribution through the elicitation of point beliefs are time-consuming and demand considerable cognitive e¤ort. Moreover, the results are valid only when agents are risk-neutral or when one uses probabilistic rules. We investigate a class of rules in...

We present a new method for constructing exact distribution-free tests (and confidence intervals) for variables that can generate more than two possible outcomes. This method separates the search for an exact test from the goal to create a non- randomized test. Randomization is used to extend...

Small sample properties are of fundamental interest when only limited data is avail- able. Exact inference is limited by constraints imposed by speci.c nonrandomized tests and of course also by lack of more data. These e¤ects can be separated as we propose to evaluate a test by comparing its...

This paper introduces a new solution concept, a minimax regret equilibrium, which allows for the possibility that players are uncertain about the rationality and conjectures of their opponents. We provide several applications of our concept. In particular, we consider pricesetting environments...

We analyze the role of commitment in pre-play communication for ensuring efficient evolutionarily stable outcomes in coordination games. All players are a priori identical as they are drawn from the same population. In games where efficient outcomes can be reached by players coordinating on the...