Saved in:
| Main Authors: | Lu, Shang, Kijima, Shuji |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2505.05014 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
The Sample Complexity of Stackelberg Games
by: Bacchiocchi, Francesco, et al.
Published: (2024)
by: Bacchiocchi, Francesco, et al.
Published: (2024)
Dueling over Multiple Pieces of Dessert
by: Brânzei, Simina, et al.
Published: (2026)
by: Brânzei, Simina, et al.
Published: (2026)
Polynomial Convergence of Bandit No-Regret Dynamics in Congestion Games
by: Dadi, Leello, et al.
Published: (2024)
by: Dadi, Leello, et al.
Published: (2024)
Uncoupled and Convergent Learning in Monotone Games under Bandit Feedback
by: Dong, Jing, et al.
Published: (2024)
by: Dong, Jing, et al.
Published: (2024)
Protocols for Verifying Smooth Strategies in Bandits and Games
by: Christ, Miranda, et al.
Published: (2025)
by: Christ, Miranda, et al.
Published: (2025)
Incentivized Learning in Principal-Agent Bandit Games
by: Scheid, Antoine, et al.
Published: (2024)
by: Scheid, Antoine, et al.
Published: (2024)
Two-Player Zero-Sum Games with Bandit Feedback
by: Yılmaz, Elif, et al.
Published: (2025)
by: Yılmaz, Elif, et al.
Published: (2025)
Competitive Multi-armed Bandit Games for Resource Sharing
by: Li, Hongbo, et al.
Published: (2025)
by: Li, Hongbo, et al.
Published: (2025)
The Complexity of Correlated Equilibria in Generalized Games
by: Bernasconi, Martino, et al.
Published: (2025)
by: Bernasconi, Martino, et al.
Published: (2025)
The Complexity of Equilibrium Refinements in Potential Games
by: Anagnostides, Ioannis, et al.
Published: (2025)
by: Anagnostides, Ioannis, et al.
Published: (2025)
Refined Sample Complexity for Markov Games with Independent Linear Function Approximation
by: Dai, Yan, et al.
Published: (2024)
by: Dai, Yan, et al.
Published: (2024)
Nearly-Optimal Bandit Learning in Stackelberg Games with Side Information
by: Balcan, Maria-Florina, et al.
Published: (2025)
by: Balcan, Maria-Florina, et al.
Published: (2025)
The Complexity of Games with Randomised Control
by: Bahmani, Sarvin, et al.
Published: (2026)
by: Bahmani, Sarvin, et al.
Published: (2026)
Universal Complexity Bounds Based on Value Iteration for Stochastic Mean Payoff Games and Entropy Games
by: Allamigeon, Xavier, et al.
Published: (2022)
by: Allamigeon, Xavier, et al.
Published: (2022)
On the Complexity of Correlated Equilibria Beyond Normal-Form Games
by: Anagnostides, Ioannis, et al.
Published: (2026)
by: Anagnostides, Ioannis, et al.
Published: (2026)
The Complexity of Two-Team Polymatrix Games with Independent Adversaries
by: Hollender, Alexandros, et al.
Published: (2024)
by: Hollender, Alexandros, et al.
Published: (2024)
The Complexity of Proper Equilibrium in Extensive-Form and Polytope Games
by: Zhang, Brian Hu, et al.
Published: (2026)
by: Zhang, Brian Hu, et al.
Published: (2026)
The Complexity of Computing Robust Mediated Equilibria in Ordinal Games
by: Conitzer, Vincent
Published: (2024)
by: Conitzer, Vincent
Published: (2024)
Settling the Complexity of Popularity in Additively Separable and Fractional Hedonic Games
by: Bullinger, Martin, et al.
Published: (2024)
by: Bullinger, Martin, et al.
Published: (2024)
Bandit Learning in Housing Markets
by: Lin, Shiyun
Published: (2025)
by: Lin, Shiyun
Published: (2025)
Sample-Efficient Regret-Minimizing Double Oracle in Extensive-Form Games
by: Tang, Xiaohang, et al.
Published: (2024)
by: Tang, Xiaohang, et al.
Published: (2024)
Concurrent Stochastic Games with Stateful-discounted and Parity Objectives: Complexity and Algorithms
by: Asadi, Ali, et al.
Published: (2024)
by: Asadi, Ali, et al.
Published: (2024)
Dueling Over Dessert, Mastering the Art of Repeated Cake Cutting
by: Brânzei, Simina, et al.
Published: (2024)
by: Brânzei, Simina, et al.
Published: (2024)
A Game-Theoretic Framework for Privacy-Aware Client Sampling in Federated Learning
by: Yuan, Wenhao, et al.
Published: (2024)
by: Yuan, Wenhao, et al.
Published: (2024)
Auctions Meet Bandits: An Empirical Analysis
by: Rashid, Mohammad, et al.
Published: (2025)
by: Rashid, Mohammad, et al.
Published: (2025)
Bandit Social Learning with Exploration Episodes
by: Banihashem, Kiarash, et al.
Published: (2026)
by: Banihashem, Kiarash, et al.
Published: (2026)
The Complexity of Symmetric Bimatrix Games with Common Payoffs
by: Ghosh, Abheek, et al.
Published: (2024)
by: Ghosh, Abheek, et al.
Published: (2024)
Data Monetization Pathways and Complex Dynamic Game Equilibrium Analysis in the Energy Industry
by: Wang, Zongxian, et al.
Published: (2024)
by: Wang, Zongxian, et al.
Published: (2024)
Hedonic Diversity Games: A Complexity Picture with More than Two Colors
by: Ganian, Robert, et al.
Published: (2022)
by: Ganian, Robert, et al.
Published: (2022)
Bandits with Preference Feedback: A Stackelberg Game Perspective
by: Pásztor, Barna, et al.
Published: (2024)
by: Pásztor, Barna, et al.
Published: (2024)
Grounded Predictions of Teamwork as a One-Shot Game: A Multiagent Multi-Armed Bandits Approach
by: Gómez, Alejandra López de Aberasturi, et al.
Published: (2024)
by: Gómez, Alejandra López de Aberasturi, et al.
Published: (2024)
Modelling Network Resilience: The Complexity of Some Graph Division Games
by: Gutowski, Grzegorz, et al.
Published: (2026)
by: Gutowski, Grzegorz, et al.
Published: (2026)
Design and Characterization of Strategy-Proof Mechanisms for Two-Facility Game on a Line
by: Lu, Pinyan, et al.
Published: (2024)
by: Lu, Pinyan, et al.
Published: (2024)
Iterative Recommendations based on Monte Carlo Sampling and Trust Estimation in Multi-Stage Vehicular Traffic Routing Games
by: Brown, Doris E. M., et al.
Published: (2025)
by: Brown, Doris E. M., et al.
Published: (2025)
How Gold to Make the Golden Snitch: Designing the "Game Changer" in Esports
by: Huang, Zhihuan, et al.
Published: (2024)
by: Huang, Zhihuan, et al.
Published: (2024)
The Complexity of Manipulation of k-Coalitional Games on Graphs
by: Barr, Hodaya, et al.
Published: (2024)
by: Barr, Hodaya, et al.
Published: (2024)
On the Complexity of Stationary Nash Equilibria in Discounted Perfect Information Stochastic Games
by: Hansen, Kristoffer Arnsfelt, et al.
Published: (2025)
by: Hansen, Kristoffer Arnsfelt, et al.
Published: (2025)
The Query Complexity of Uniform Pricing
by: Chen, Houshuang, et al.
Published: (2025)
by: Chen, Houshuang, et al.
Published: (2025)
Parameterized Complexity of Hedonic Games with Enemy-Oriented Preferences
by: Durand, Martin, et al.
Published: (2025)
by: Durand, Martin, et al.
Published: (2025)
The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games
by: Anagnostides, Ioannis, et al.
Published: (2025)
by: Anagnostides, Ioannis, et al.
Published: (2025)
Similar Items
-
The Sample Complexity of Stackelberg Games
by: Bacchiocchi, Francesco, et al.
Published: (2024) -
Dueling over Multiple Pieces of Dessert
by: Brânzei, Simina, et al.
Published: (2026) -
Polynomial Convergence of Bandit No-Regret Dynamics in Congestion Games
by: Dadi, Leello, et al.
Published: (2024) -
Uncoupled and Convergent Learning in Monotone Games under Bandit Feedback
by: Dong, Jing, et al.
Published: (2024) -
Protocols for Verifying Smooth Strategies in Bandits and Games
by: Christ, Miranda, et al.
Published: (2025)