Game Theory

Of Dice and Games: A Theory of Generalized Boosting COLT 2025 On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms ICML 2025 Online Resource Sharing: Better Robust Guarantees via Randomized Strategies IJCAI 2025 On the Convergence of Min-Max Langevin Dynamics and Algorithm COLT 2025 On the Convergence of No-Regret Dynamics in Information Retrieval Games with Proportional Ranking Functions ICLR 2025 On the Convergence of Tâtonnement for Linear Fisher Markets AAAI 2025 On the Power of Randomization for Obviously Strategy-Proof Mechanisms AAAI 2025 On the Power of Strategic Corpus Enrichment in Content Creation Games AAAI 2025 Open Problem: Optimal Instance-Dependent Sample Complexity for finding Nash Equilibrium in Two Player Zero-Sum Matrix games COLT 2025 Optimal Auction Design for Mixed Bidders AAAI 2025 Optimal Online Bookmaking for Any Number of Outcomes COLT 2025 PAC Learning with Improvements ICML 2025 Paid with Models: Optimal Contract Design for Collaborative Machine Learning AAAI 2025 Participatory Budgeting Project Strength via Candidate Control IJCAI 2025 p-Mean Regret for Stochastic Bandits AAAI 2025 Policy Design for Two-sided Platforms with Participation Dynamics ICML 2025 Policy Iteration for Two-Player General-Sum Stochastic Stackelberg Games ACML 2025 Private Blotto: Viewpoint Competition with Polarized Agents AAAI 2025 Probabilistic Strategy Logic with Degrees of Observability AAAI 2025 Proportional Representation in Practice: Quantifying Proportionality in Ordinal Elections AAAI 2025 Pure and Strong Nash Equilibrium Computation in Compactly Representable Aggregate Games UAI 2025 Randomised Optimism via Competitive Co-Evolution for Matrix Games with Bandit Feedback IJCAI 2025 Rapid Learning in Constrained Minimax Games with Negative Momentum AAAI 2025 Reducing Variance of Stochastic Optimization for Approximating Nash Equilibria in Normal-Form Games ICML 2025 Replicating Electoral Success AAAI 2025