:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Bansak, Kirk, Paulson, Elisabeth
Format:	Preprint
Published:	2020
Subjects:	Optimization and Control Computer Science and Game Theory Machine Learning Methodology
Online Access:	https://arxiv.org/abs/2007.03069
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Dynamic Matching with Post-allocation Service and its Application to Refugee Resettlement
by: Bansak, Kirk, et al.
Published: (2024)

Machine-Learned Prediction Equilibrium for Dynamic Traffic Assignment
by: Graf, Lukas, et al.
Published: (2021)

On the Convergence of Min-Max Langevin Dynamics and Algorithm
by: Cai, Yang, et al.
Published: (2024)

Optimal Online Bookmaking for Any Number of Outcomes
by: Tal, Hadar, et al.
Published: (2025)

MALADY: Multiclass Active Learning with Auction Dynamics on Graphs
by: Bhusal, Gokul, et al.
Published: (2024)

Learning Dynamic Mechanisms in Unknown Environments: A Reinforcement Learning Approach
by: Qiu, Shuang, et al.
Published: (2022)

Finite-Sample Guarantees for Learning Dynamics in Zero-Sum Polymatrix Games
by: Faizal, Fathima Zarin, et al.
Published: (2024)

Data-Scarce Identification of Game Dynamics via Sum-of-Squares Optimization
by: Sakos, Iosif, et al.
Published: (2023)

Stochastic Prediction Equilibrium for Dynamic Traffic Assignment
by: Graf, Lukas, et al.
Published: (2024)

An Equilibrium Dynamic Traffic Assignment Model with Linear Programming Formulation
by: Guseva, Victoria, et al.
Published: (2024)

Online Fair Allocation of Perishable Resources
by: Banerjee, Siddhartha, et al.
Published: (2024)

A game-theoretic approach for Generative Adversarial Networks
by: Franci, Barbara, et al.
Published: (2020)

A pragmatic policy learning approach to account for users' fatigue in repeated auctions
by: Heymann, Benjamin, et al.
Published: (2024)

The Oracle Complexity of Simplex-based Matrix Games
by: Kornowski, Guy, et al.
Published: (2024)

Reinforcement Learning for Finite Space Mean-Field Type Games
by: Shao, Kai, et al.
Published: (2024)

Satisficing Paths and Independent Multi-Agent Reinforcement Learning in Stochastic Games
by: Yongacoglu, Bora, et al.
Published: (2021)

Mistake, Manipulation and Margin Guarantees in Online Strategic Classification
by: Shen, Lingqing, et al.
Published: (2024)

Unsupervised Solution Operator Learning for Mean-Field Games via Sampling-Invariant Parametrizations
by: Huang, Han, et al.
Published: (2024)

Finite-Agent Stochastic Differential Games on Large Graphs: II. Graph-Based Architectures
by: Hu, Ruimeng, et al.
Published: (2025)

Blind Network Revenue Management and Bandits with Knapsacks under Limited Switches
by: Simchi-Levi, David, et al.
Published: (2019)

Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization
by: Daskalakis, Constantinos, et al.
Published: (2018)

On Separation Between Best-Iterate, Random-Iterate, and Last-Iterate Convergence of Learning in Games
by: Cai, Yang, et al.
Published: (2025)

Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback
by: Ba, Wenjia, et al.
Published: (2021)

A Deep Learning Method for Optimal Investment Under Relative Performance Criteria Among Heterogeneous Agents
by: Laurière, Mathieu, et al.
Published: (2024)

Exploiting Approximate Symmetry for Efficient Multi-Agent Reinforcement Learning
by: Yardim, Batuhan, et al.
Published: (2024)

Faster Rates for No-Regret Learning in General Games via Cautious Optimism
by: Soleymani, Ashkan, et al.
Published: (2025)

Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms
by: Cai, Yang, et al.
Published: (2024)

Cautious Optimism: A Meta-Algorithm for Near-Constant Regret in General Games
by: Soleymani, Ashkan, et al.
Published: (2025)

Expected Variational Inequalities
by: Zhang, Brian Hu, et al.
Published: (2025)

Stochastic variance reduced extragradient methods for solving hierarchical variational inequalities
by: Dvurechensky, Pavel, et al.
Published: (2026)

Optimistic Online Learning in Symmetric Cone Games
by: Barakat, Anas, et al.
Published: (2025)

Convergence of Regret Matching in Potential Games and Constrained Optimization
by: Anagnostides, Ioannis, et al.
Published: (2025)

Last-Iterate Convergence of Adaptive Riemannian Gradient Descent for Equilibrium Computation
by: Cai, Yang, et al.
Published: (2023)

Achieving Logarithmic Regret in KL-Regularized Zero-Sum Markov Games
by: Nayak, Anupam, et al.
Published: (2025)

Online Generalized-mean Welfare Maximization: Achieving Near-Optimal Regret from Samples
by: Yang, Zongjun, et al.
Published: (2026)

Small-Gain Nash: Certified Contraction to Nash Equilibria in Differentiable Games
by: Sharma, Vedansh
Published: (2025)

PAPAL: A Provable PArticle-based Primal-Dual ALgorithm for Mixed Nash Equilibrium
by: Ding, Shihong, et al.
Published: (2023)

From Average-Iterate to Last-Iterate Convergence in Games: A Reduction and Its Applications
by: Cai, Yang, et al.
Published: (2025)

Near-Optimal Policy Optimization for Correlated Equilibrium in General-Sum Markov Games
by: Cai, Yang, et al.
Published: (2024)

An Exponentially Converging Particle Method for the Mixed Nash Equilibrium of Continuous Games
by: Wang, Guillaume, et al.
Published: (2022)