Oxford Events, the new replacement for OxTalks, will launch on 16th March. From now until the launch of Oxford Events, new events cannot be published or edited on OxTalks while all existing records are migrated to the new platform. The existing OxTalks site will remain available to view during this period.
From 16th, Oxford Events will launch on a new website: events.ox.ac.uk, and event submissions will resume. You will need a Halo login to submit events. Full details are available on the Staff Gateway.
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.
