| Multiplicative pacing equilibria in auction markets V Conitzer, C Kroer, E Sodomka, NE Stier-Moses Operations Research 70 (2), 963-989, 2022 | 75* | 2022 |
| Extensive-form game abstraction with bounds C Kroer, T Sandholm Proceedings of the fifteenth ACM conference on Economics and computation …, 2014 | 61 | 2014 |
| Online convex optimization for sequential decision processes and extensive-form games G Farina, C Kroer, T Sandholm Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 1917-1925, 2019 | 59 | 2019 |
| Pacing equilibrium in first price auction markets V Conitzer, C Kroer, D Panigrahi, O Schrijvers, NE Stier-Moses, ... Management Science 68 (12), 8515-8535, 2022 | 53 | 2022 |
| Faster algorithms for extensive-form game solving via improved smoothing functions C Kroer, K Waugh, F Kılınç-Karzan, T Sandholm Mathematical Programming 179 (1-2), 385-417, 2020 | 51 | 2020 |
| Faster first-order methods for extensive-form game solving C Kroer, K Waugh, F Kilinç-Karzan, T Sandholm Proceedings of the Sixteenth ACM Conference on Economics and Computation …, 2015 | 49 | 2015 |
| Dynamic thresholding and pruning for regret minimization N Brown, C Kroer, T Sandholm Proceedings of the AAAI conference on artificial intelligence 31 (1), 2017 | 48 | 2017 |
| Automated Planning for Liner Shipping Fleet Repositioning K Tierney, A Coles, A Coles, C Kroer, AM Britt, RM Jensen International Conference on Automated Planning and Scheduling, ICAPS'12, 2012 | 43 | 2012 |
| Imperfect-recall abstractions with bounds in games C Kroer, T Sandholm Proceedings of the 2016 ACM Conference on Economics and Computation, 459-476, 2016 | 41* | 2016 |
| Solving large sequential games with the excessive gap technique C Kroer, G Farina, T Sandholm Advances in neural information processing systems 31, 2018 | 39 | 2018 |
| Faster game solving via predictive blackwell approachability: Connecting regret matching and mirror descent G Farina, C Kroer, T Sandholm Proceedings of the AAAI Conference on Artificial Intelligence 35 (6), 5363-5371, 2021 | 37 | 2021 |
| Optimistic regret minimization for extensive-form games via dilated distance-generating functions G Farina, C Kroer, T Sandholm Advances in neural information processing systems 32, 2019 | 35 | 2019 |
| Regret minimization in behaviorally-constrained zero-sum games G Farina, C Kroer, T Sandholm International Conference on Machine Learning, 1107-1116, 2017 | 31 | 2017 |
| Stable-predictive optimistic counterfactual regret minimization G Farina, C Kroer, N Brown, T Sandholm International conference on machine learning, 1853-1862, 2019 | 29 | 2019 |
| Theoretical and practical advances on smoothing for extensive-form games C Kroer, K Waugh, F Kilinc-Karzan, T Sandholm arXiv preprint arXiv:1702.04849, 2017 | 28 | 2017 |
| Robust Stackelberg equilibria in extensive-form games and extension to limited lookahead C Kroer, G Farina, T Sandholm Proceedings of the AAAI Conference on Artificial Intelligence 32 (1), 2018 | 26 | 2018 |
| Regret circuits: Composability of regret minimizers G Farina, C Kroer, T Sandholm International conference on machine learning, 1863-1872, 2019 | 25 | 2019 |
| Power napping with loud neighbors: Optimal energy-constrained jamming and anti-jamming B DeBruhl, C Kroer, A Datta, T Sandholm, P Tague Proceedings of the 2014 ACM conference on Security and privacy in wireless …, 2014 | 25 | 2014 |
| Computing large market equilibria using abstractions C Kroer, A Peysakhovich, E Sodomka, NE Stier-Moses Proceedings of the 2019 ACM Conference on Economics and Computation, 745-746, 2019 | 24 | 2019 |
| Smoothing method for approximate extensive-form perfect equilibrium C Kroer, G Farina, T Sandholm arXiv preprint arXiv:1705.09326, 2017 | 24 | 2017 |
Tuomas SandholmAngel Jordan University Professor of Computer Science, Carnegie Mellon UniversityVerified email at cs.cmu.edu
