Efficient Kernelized Learning in Polyhedral Games Beyond Full-Information: From Colonel Blotto to Congestion Games
cs.GT, cs.LG, math.OC, stat.ML
Submitted: 2025-09-25
Updated: 2025-10-09
Terminology
Sources
- An efficient high-probability algorithm for Linear Bandits
- Polynomial Convergence of Bandit No-Regret Dynamics in Congestion Games
- Routing in an Uncertain World: Adaptivity, Efficiency, and Equilibrium
Related papers
- How Many Votes is a Lie Worth? Measuring Strategyproofness through Resource Augmentation
- Effective Horizons for Prophet Inequalities with Discounted I.I.D. Rewards
- Truthful-in-Expectation Mechanism with Constant Maximin-Share Guarantee
- The Power of Recruiting the Smaller Side: Two Additional Traders Suffice in Two-Sided Markets
- From signaling to interviews in random matching markets
- Optimizing Social Utility in Sequential Experiments