OxTalks will soon be transitioning to Oxford Events (full details are available on the Staff Gateway). A two-week publishing freeze is expected in early Hilary to allow all events to be migrated to the new platform. During this period, you will not be able to submit or edit events on OxTalks. The exact freeze dates will be confirmed as soon as possible.
If you have any questions, please contact halo@digital.ox.ac.uk
This paper introduces a new simulation algorithm for evaluating the log-likelihood and score functions associated with a class of supermodular complete information discrete games. The algorithm allows for payoff function estimation in games with large numbers of players and/or
many binary actions per player (e.g., games with tens of thousands of strategic binary actions). In such cases the likelihood of the observed pure strategy combination may be (i) very small and (ii)
a high dimensional integral with a complex integration region. Direct numerical integration, as well as accept-reject Monte Carlo integration, are computationally impractical in such settings. In contrast, our method allows for accurate likelihood simulation with modest numbers of simulation draws. Use cases include simulated maximum likelihood (SML) parameter estimation in models of technology adoption, peer effects, and strategic network formation.
