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 consider the problem of pricing a single object when the seller has only minimal information about the true valuation of the buyer. Specifically, the seller only knows the support of the possible valuations and has no further distributional information.The seller is solving this choice...

A natural way to obtain information about the concentration and dispersion of an expert's beliefs is to ask for a confidence interval. Our objective is to design an elicitation mechanism that rewards the expert on the basis of the realized event and satisfies a set of desirable properties. We...

We show how to bid in first-price auctions when a bidder knows her own value but not how others will bid. To do this we introduce a novel and general method for how to make choices in strategic settings without assuming common knowledge or equilibrium behavior. Accordingly, first eliminate...

This paper introduces the concept of ordient for binary relations (prefer-ences), a relative of the concept of gradient for functions (utilities). The mainmotivation for this study is to replace the binary relation at the center stageof economic analysis, rather than its representation (whenever...

The stochastic inequality test is an exact non-parametric test that can be used to infer whether values in one random sample tend to be higher than in another. In addition it can be used to derive a confidence interval around an intuitive measure of effect size that is readily interpretable...

We study sequential search without priors. Our interest lies in decision rules that are close to being optimal under each prior and after each history. We call these rules robust. The search literature employs optimal rules based on cutoff strategies, and these rules are not robust. We derive...

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 price-setting environments...