:: Library Catalog

Saved in:

Bibliographic Details
Main Authors:	Vadori, Nelson, Savani, Rahul
Format:	Preprint
Published:	2023
Subjects:	Computer Science and Game Theory Machine Learning
Online Access:	https://arxiv.org/abs/2306.05366
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Impact of Decentralized Learning on Player Utilities in Stackelberg Games
by: Donahue, Kate, et al.
Published: (2024)

Two-Player Zero-Sum Games with Bandit Feedback
by: Yılmaz, Elif, et al.
Published: (2025)

Independent Policy Mirror Descent for Markov Potential Games: Scaling to Large Number of Players
by: Alatur, Pragnya, et al.
Published: (2024)

Multi-Player Zero-Sum Markov Games with Networked Separable Interactions
by: Park, Chanwoo, et al.
Published: (2023)

Offline Two-Player Zero-Sum Markov Games with KL Regularization
by: Chen, Claire, et al.
Published: (2026)

Corruption-Robust Offline Two-Player Zero-Sum Markov Games
by: Nika, Andi, et al.
Published: (2024)

Tight Regret Upper and Lower Bounds for Optimistic Hedge in Two-Player Zero-Sum Games
by: Tsuchiya, Taira
Published: (2025)

A Framework for Finding Local Saddle Points in Two-Player Zero-Sum Black-Box Games
by: Agarwal, Shubhankar, et al.
Published: (2025)

Learning Nash Equilibrial Hamiltonian for Two-Player Collision-Avoiding Interactions
by: Zhang, Lei, et al.
Published: (2025)

Value Approximation for Two-Player General-Sum Differential Games with State Constraints
by: Zhang, Lei, et al.
Published: (2023)

A Bayesian Learning Algorithm for Unknown Zero-sum Stochastic Games with an Arbitrary Opponent
by: Jafarnia-Jahromi, Mehdi, et al.
Published: (2021)

Mitigating the Participation Bias by Balancing Extreme Ratings
by: Guo, Yongkang, et al.
Published: (2025)

Optimal Rates for Feasible Payoff Set Estimation in Games
by: Barbara, Annalisa, et al.
Published: (2026)

The Surprising Benefits of Base Rate Neglect in Robust Aggregation
by: Kong, Yuqing, et al.
Published: (2024)

Mirror Mode in Fire Emblem: Beating Players at their own Game with Imitation and Reinforcement Learning
by: Smid, Yanna Elizabeth, et al.
Published: (2025)

Bayesian Learning in Episodic Zero-Sum Games
by: Yueh, Chang-Wei, et al.
Published: (2026)

Multi-Head Attention Is a Multi-Player Game
by: Chakrabarti, Kushal, et al.
Published: (2026)

GroupSegment-SHAP: Shapley Value Explanations with Group-Segment Players for Multivariate Time Series
by: Kim, Jinwoong, et al.
Published: (2026)

Better Regret Rates in Bilateral Trade via Sublinear Budget Violation
by: Lunghi, Anna, et al.
Published: (2025)

On Characterizations of Potential and Ordinal Potential Games
by: Arefizadeh, Sina, et al.
Published: (2024)

Convergence to Nash Equilibrium and No-regret Guarantee in (Markov) Potential Games
by: Dong, Jing, et al.
Published: (2024)

Transformers as Game Players: Provable In-context Game-playing Capabilities of Pre-trained Models
by: Shi, Chengshuai, et al.
Published: (2024)

Provable Policy Gradient Methods for Average-Reward Markov Potential Games
by: Cheng, Min, et al.
Published: (2024)

Global Convergence of Multi-Agent Policy Gradient in Markov Potential Games
by: Leonardos, Stefanos, et al.
Published: (2021)

From Natural Language to Extensive-Form Game Representations
by: Deng, Shilong, et al.
Published: (2025)

The Complexity of Sparse Win-Lose Bimatrix Games
by: Batziou, Eleni, et al.
Published: (2026)

Gradient-based Learning in State-based Potential Games for Self-Learning Production Systems
by: Yuwono, Steve, et al.
Published: (2024)

Policy Iteration for Two-Player General-Sum Stochastic Stackelberg Games
by: Kudo, Mikoto, et al.
Published: (2024)

Graphon Mean Field Games with a Representative Player: Analysis and Learning Algorithm
by: Zhou, Fuzhong, et al.
Published: (2024)

Semivalue-based data valuation is arbitrary and gameable
by: Diehl, Hannah, et al.
Published: (2025)

A Soft Inducement Framework for Incentive-Aided Steering of No-Regret Players
by: Yorulmaz, Asrin Efe, et al.
Published: (2025)

Data Trading Combination Auction Mechanism based on the Exponential Mechanism
by: Chen, Kongyang, et al.
Published: (2024)

Intelligent Agents for Auction-based Federated Learning: A Survey
by: Tang, Xiaoli, et al.
Published: (2024)

Autobidding Arena: unified evaluation of the classical and RL-based autobidding algorithms
by: Pudovikov, Andrey, et al.
Published: (2025)

Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint
by: Vaze, Rahul, et al.
Published: (2025)

An explainable machine learning-based approach for analyzing customers' online data to identify the importance of product attributes
by: Karimzadeh, Aigin, et al.
Published: (2024)

Independent Learning in Constrained Markov Potential Games
by: Jordan, Philip, et al.
Published: (2024)

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

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

Ordinal Lindahl Equilibrium for Voting
by: Song, Haoyu, et al.
Published: (2026)