← Authors

Christian Kroer

54 papers · 2015–2026 · 5 conferences · across top CS/AI conferences

Achievements

πŸ—ΊοΈ Taxonomy Completionist (38) 🌍 Conference Polyglot (5) πŸƒ Academic Marathon (10) 🐝 Cross-Pollinator (14) πŸŒ‰ Interdisciplinary Bridge 🧭 Keyword Pioneer 🐣 Hot Topic Early Bird 🀝 Dynamic Duo (19) πŸ‘‘ Triple Crown πŸ† Grand Slam πŸ”¬ Deep Specialist (34) 🧬 Topic Evolution πŸ† Keyword Champion (6) ⚑ Prolific Year (9) πŸ—ƒοΈ Keyword Collector (185) πŸ”₯ Unstoppable (11) πŸ’Ž Century Club (51) πŸš€ Conference Pioneer

Conferences

NIPS (18) AAAI (16) ICML (10) IJCAI (6) ICLR (4)

Top co-authors

Gabriele Farina (19) Tuomas Sandholm (17) Yuan Gao (8) Chung-Wei Lee (7) Haipeng Luo (7) Julien Grand-Clément (6) Luofeng Liao (6) Jakub Černý (5) Chun Kai Ling (4) Darshan Chakrabarti (4)

Keywords

extensive-form game (17) nash equilibrium (14) game theory (11) regret minimization (8) convex optimization (7) regret bound (7) zero-sum game (7) first-order method (6) market equilibrium (6) online learning (6) counterfactual regret minimization (5) counterfactual regret (4) multi-agent system (4) fisher market (4) equilibrium refinement (3) fair allocation (3) security game (3) online mirror descent (3) resource allocation (3) mirror descent (3)

Papers

Security Games with Layered Defenses: Adaptive Adversaries and Gittins Indices AAAI 2026
Colonel Blotto with Battlefield Games AAAI 2026
Spatial Branch-and-Bound for Computing Multiplayer Nash Equilibrium AAAI 2026
On the Convergence of TΓ’tonnement for Linear Fisher Markets AAAI 2025
Interference Among First-Price Pacing Equilibria: A Bias and Variance Analysis ICLR 2025
Last-Iterate Convergence Properties of Regret-Matching Algorithms in Games ICLR 2025
Commitment to Sparse Strategies in Two-Player Games AAAI 2025
Extensive-Form Game Solving via Blackwell Approachability on Treeplexes NIPS 2024
On the Optimality of Dilated Entropy and Lower Bounds for Online Learning in Extensive-Form Games NIPS 2024
Layered Graph Security Games IJCAI 2024
Efficient Learning in Polyhedral Games via Best-Response Oracles AAAI 2024
Bootstrapping Fisher Market Equilibrium and First-Price Pacing Equilibrium ICML 2024
Online Learning under Budget and ROI Constraints via Weak Adaptivity ICML 2024
Automated Design of Affine Maximizer Mechanisms in Dynamic Settings AAAI 2024
Greedy-Based Online Fair Allocation with Adversarial Input: Enabling Best-of-Many-Worlds Guarantees AAAI 2024
Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms NIPS 2024
Regret Matching+: (In)Stability and Fast Convergence in Games NIPS 2023
Statistical Inference for Fisher Market Equilibrium ICLR 2023
Fast and Interpretable Dynamics for Fisher Markets via Block-Coordinate Updates AAAI 2023
Block-Coordinate Methods and Restarting for Solving Extensive-Form Games NIPS 2023
Statistical Inference and A/B Testing for First-Price Pacing Equilibria ICML 2023
A Unified Approach to Reinforcement Learning, Quantal Response Equilibria, and Two-Player Zero-Sum Games ICLR 2023
Kernelized Multiplicative Weights for 0/1-Polyhedral Games: Bridging the Gap Between Learning in Extensive-Form and Normal-Form Games ICML 2022
Uncoupled Learning Dynamics with $O(\log T)$ Swap Regret in Multiplayer Games NIPS 2022
Optimal Efficiency-Envy Trade-Off via Optimal Transport NIPS 2022
Nonstationary Dual Averaging and Online Fair Allocation NIPS 2022
Near-Optimal No-Regret Learning Dynamics for General Convex Games NIPS 2022
Online Learning with Knapsacks: the Best of Both Worlds ICML 2022
Increasing Iterate Averaging for Solving Saddle-Point Problems AAAI 2021
Infinite-Dimensional Fisher Markets: Equilibrium, Duality and Optimization AAAI 2021
Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent AAAI 2021
Online Market Equilibrium with Application to Fair Division NIPS 2021
First-Order Methods for Wasserstein Distributionally Robust MDP ICML 2021
Last-iterate Convergence in Extensive-Form Games NIPS 2021
Conic Blackwell Algorithm: Parameter-Free Convex-Concave Saddle-Point Solving NIPS 2021
Dominant Resource Fairness with Meta-Types IJCAI 2021
Scalable First-Order Methods for Robust MDPs AAAI 2021
First-Order Methods for Large-Scale Market Equilibrium Computation NIPS 2020
Evaluating and Rewarding Teamwork Using Cooperative Game Abstractions NIPS 2020
Stochastic Regret Minimization in Extensive-Form Games ICML 2020
Robust Market Equilibria with Uncertain Preferences AAAI 2020
Regret Circuits: Composability of Regret Minimizers ICML 2019
Optimistic Regret Minimization for Extensive-Form Games via Dilated Distance-Generating Functions NIPS 2019
Robust Multi-agent Counterfactual Prediction NIPS 2019
Quasi-Perfect Stackelberg Equilibrium AAAI 2019
Online Convex Optimization for Sequential Decision Processes and Extensive-Form Games AAAI 2019
Stable-Predictive Optimistic Counterfactual Regret Minimization ICML 2019
Solving Large Sequential Games with the Excessive Gap Technique NIPS 2018
A Unified Framework for Extensive-Form Game Abstraction with Bounds NIPS 2018
Trembling-Hand Perfection in Extensive-Form Games with Commitment IJCAI 2018
Regret Minimization in Behaviorally-Constrained Zero-Sum Games ICML 2017
Smoothing Method for Approximate Extensive-Form Perfect Equilibrium IJCAI 2017
Sequential Planning for Steering Immune System Adaptation IJCAI 2016
Limited Lookahead in Imperfect-Information Games IJCAI 2015