Large Robust Games
From MaRDI portal
Publication:5475058
DOI10.1111/j.1468-0262.2004.00549.xzbMath1141.91312OpenAlexW3123166147MaRDI QIDQ5475058
Publication date: 16 June 2006
Published in: Econometrica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1468-0262.2004.00549.x
Related Items (54)
Large strategic dynamic interactions ⋮ Robust perfect equilibrium in large games ⋮ The Lipschitz constant of perturbed anonymous games ⋮ On the closed-graph property of the Nash equilibrium correspondence in a large game: a complete characterization ⋮ Imitation, coordination and the emergence of Nash equilibrium ⋮ Pure-strategy Nash equilibria in large games: characterization and existence ⋮ Symmetry and approximate equilibria in games with countably many players ⋮ Behavioral conformity in games with many players ⋮ A link between sequential semi-anonymous nonatomic games and their large finite counterparts ⋮ Query complexity of approximate equilibria in anonymous games ⋮ Pure strategy Nash equilibria of large finite-player games and their relationship to non-atomic games ⋮ Fairness and partial coercion in land assembly ⋮ Moral hazard with excess returns ⋮ Stability in large Bayesian games with heterogeneous players ⋮ Stable outcomes and information in games: an empirical framework ⋮ Econometric inference on a large Bayesian game with heterogeneous beliefs ⋮ On constrained generalized games with action sets in non-locally-convex and non-Hausdorff topological vector spaces ⋮ Trimmed equilibrium ⋮ Action-graph games ⋮ Epsilon-equilibria of perturbed games ⋮ Asymptotic interpretations for equilibria of nonatomic games ⋮ Robustness of equilibria in anonymous local games ⋮ Efficiency and information aggregation in large uniform-price auctions ⋮ Aggregate comparative statics ⋮ A family of identities related to zero-sum and team games ⋮ Ex post implementation ⋮ Logarithmic query complexity for approximate Nash computation in large games ⋮ Ex-post stability of Bayes-Nash equilibria of large games ⋮ Networks and Stability ⋮ The efficiency of competitive mechanisms under private information ⋮ Large games and the law of large numbers ⋮ Analysis of Markovian competitive situations using nonatomic games ⋮ College assignment as a large contest ⋮ Extended decision field theory with social-learning for long-term decision-making processes in social networks ⋮ \(t\)-wise independence with local dependencies ⋮ On purification of equilibrium in Bayesian games and expost Nash equilibrium ⋮ On equilibrium in pure strategies in games with many players ⋮ On pure conjectural equilibrium with non-manipulable information ⋮ On the existence of Nash equilibria in large games ⋮ Large but finite games with asymmetric information ⋮ Partial exposure in large games ⋮ Fault tolerance in large games ⋮ Computer science and decision theory ⋮ Climb on the bandwagon: consensus and periodicity in a lifetime utility model with strategic interactions ⋮ Purification of Bayesian-Nash equilibria in large games with compact type and action spaces ⋮ Rare Nash Equilibria and the Price of Anarchy in Large Static Games ⋮ On the existence of pure-strategy equilibria in large games ⋮ Logarithmic Query Complexity for Approximate Nash Computation in Large Games ⋮ Protocol invariance and the timing of decisions in dynamic games ⋮ Categorizing others in a large game ⋮ Rationality in the Full-Information Model ⋮ On pure-strategy Nash equilibria in large games ⋮ A Bayesian nonatomic game and its applicability to finite-player situations ⋮ On the uniqueness of quantal response equilibria and its application to network games
This page was built for publication: Large Robust Games
