Speaker: Eva Tardos

Affiliation: Cornell University

Abstract:

Typical models of strategic interactions in computer science use simultaneous move games. However, in applications simultaneity is often hard or impossible to achieve. In this talk we study the robustness of the Nash Equilibrium when the assumption of simultaneity is dropped. In some classes of games sequential action significantly improves the quality of the predicted solution, resulting in much more natural and better quality prediction. In the context of auctions, sequential implementation gives players interesting strategic opportunities and introduces externalities in the auction game.  We study such games in an attempt to understand the role of simultaneity in simple auction formats (such as simultaneous first or second price auctions).