Multiple oracle algorithm to solve continuous games

DOI10.1007/978-3-031-26369-9_8arXiv2109.04178MaRDI QIDQ6116849

Tomáš Kroupa, Tomáš Votroubek

Publication date: 16 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.04178

zbMATH Keywords

Nash equilibriumnon-cooperative gamecontinuous gamepolynomial game

Mathematics Subject Classification ID

Noncooperative games (91A10) Equilibrium refinements (91A11)

Cites Work

• Unnamed Item
• Unnamed Item
• Computational Optimal Transport: With Applications to Data Science
• Semidefinite programming for min-max problems and games
• Computing Nash equilibria by iterated polymatrix approximation
• Separable and low-rank continuous games
• Limit games and limit equilibria
• A global Newton method to compute Nash equilibria.
• Complementarity problems in GAMS and the PATH solver
• Note on unique Nash equilibrium in continuous games
• Learning in games with continuous action sets and unknown payoff functions
• Algorithm for computing approximate Nash equilibrium in continuous games with application to continuous blotto
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Best response dynamics for continuous zero-sum games
• Zero-Sum Polymatrix Games: A Generalization of Minmax
• An Introduction to Polynomial and Semi-Algebraic Optimization
• An Exact Double-Oracle Algorithm for Zero-Sum Extensive-Form Games with Imperfect Information
• Optimization with PDE Constraints
• On Choosing and Bounding Probability Metrics
• The Complexity of Computing a Nash Equilibrium
• An Invitation to Statistics in Wasserstein Space
• JuMP: A Modeling Language for Mathematical Optimization
• A Further Generalization of the Kakutani Fixed Point Theorem, with Application to Nash Equilibrium Points

This page was built for publication: Multiple oracle algorithm to solve continuous games