We propose a data-constrained generalized maximum entropy (GME) estimator for discrete sequential move games of perfect information which can be easily implemented on optimization software with high-level interfaces such as GAMS. Unlike most other work on the estimation of complete information...

We propose simulation based estimation for discrete sequential move games of perfect information which relies on the simulated moments and importance sampling. We use importance sampling techniques not only to reduce computational burden and simulation error, but also to overcome non-smoothness...

This paper studies the problem of identifying and estimating the normal-form payoff parameters of a simultaneous, discrete game of complete information where the equilibrium concept employed is correlated equilibrium rather than Nash equilibrium. We show that once we extend the equilibrium...

We develop a model of strategic grade determination by universities distinguished by their distributions of student academic abilities. Universities choose grading standards to maximize total wages of graduates. Job placement and wages hinge on a firm’s productivity assessment given a...

We model how the choices by students to “rush” a fraternity, and the choices by a fraternity of whom to admit, interact with the signals that firms receive about student productivities to determine labor market outcomes. Both the fraternity and students care about future wages and fraternity...