In this paper, we develop a Bayesian analysis of a semi-parametric binary choice model. The prior specification of the functional parameter, namely the distribution function of a latent variable, is of the Dirichlet process type and the prior specification of the Euclidean parameter, namely the...

We introduce a procedure that uses basic typological charasteristics of equilibrium correspondences of standard equilibrium concepts, to define broad equivalence classes of finite generic games in normal form. The proposed procedure is viewed as a potentially useful way of both organizing the...

A separation heuristic for mixed integer programs is presented that theoretically allows one to derive several families of " strong" valid inequalities for specific models and compuationally gives results as good as or better than those obtained from several existing separation routines...

In this paper, minimal conditions under which a semi-parametric binary response model is identified in a Bayesian framework are presented and compared to the conditions usually required in a sampling theory framework.

We explore the consequences of the assumptions used in modern cryptography when applied to repeated games with public communication. Technically speaking, we model agents by polynomial Turing machines and assume the existence of a trapdoor function. Under these conditions, we prove a Folk...

Two approaches have been proposed in the literature to refine the rationalizability solution concept: either assuming that players make small errors when playing their strategies, or assuming that there is a small amount of payoff uncertainty. We show that both approaches lead to the same...