| Improved Sample Complexity Bounds for Branch-And-Cut | 0 | 0.34 | 2022 |
| Fast Payoff Matrix Sparsification Techniques for Structured Extensive-Form Games. | 0 | 0.34 | 2022 |
| Faster No-Regret Learning Dynamics for Extensive-Form Correlated and Coarse Correlated Equilibria | 0 | 0.34 | 2022 |
| Subgame solving without common knowledge. | 0 | 0.34 | 2021 |
| Better Regularization for Sequential Decision Spaces: Fast Convergence Rates for Nash, Correlated, and Team Equilibria | 0 | 0.34 | 2021 |
| Equilibrium Refinement for the Age of Machines: The One-Sided Quasi-Perfect Equilibrium. | 0 | 0.34 | 2021 |
| Efficient Algorithms for Learning Revenue-Maximizing Two-Part Tariffs | 0 | 0.34 | 2020 |
| Small Nash Equilibrium Certificates in Very Large Games | 0 | 0.34 | 2020 |
| Stochastic Regret Minimization in Extensive-Form Games | 0 | 0.34 | 2020 |
| Improving Policy-Constrained Kidney Exchange via Pre-Screening | 0 | 0.34 | 2020 |
| Quasi-Perfect Stackelberg Equilibrium. | 0 | 0.34 | 2019 |
| Correlation in Extensive-Form Games: Saddle-Point Formulation and Benchmarks. | 0 | 0.34 | 2019 |
| Estimating Approximate Incentive Compatibility. | 0 | 0.34 | 2019 |
| Optimistic Regret Minimization for Extensive-Form Games via Dilated Distance-Generating Functions | 0 | 0.34 | 2019 |
| Depth-Limited Solving for Imperfect-Information Games. | 3 | 0.40 | 2018 |
| A General Theory of Sample Complexity for Multi-Item Profit Maximization. | 3 | 0.38 | 2018 |
| Practical exact algorithm for trembling-hand equilibrium refinements in games. | 1 | 0.35 | 2018 |
| Deep Counterfactual Regret Minimization. | 4 | 0.41 | 2018 |
| Solving Large Sequential Games with the Excessive Gap Technique. | 1 | 0.36 | 2018 |
| Ex ante coordination and collusion in zero-sum multi-player extensive-form games. | 2 | 0.38 | 2018 |
| Theoretical and Practical Advances on Smoothing for Extensive-Form Games. | 2 | 0.39 | 2017 |
| Exclusion Method for Finding Nash Equilibrium in Multiplayer Games. | 0 | 0.34 | 2017 |
| Dynamic Thresholding and Pruning for Regret Minimization. | 10 | 0.60 | 2017 |
| Reduced Space and Faster Convergence in Imperfect-Information Games via Regret-Based Pruning. | 2 | 0.40 | 2017 |
| Libratus: The Superhuman AI for No-Limit Poker. | 3 | 0.50 | 2017 |
| Multi-Organ Exchange. | 0 | 0.34 | 2017 |
| Small Representations of Big Kidney Exchange Graphs. | 1 | 0.35 | 2017 |
| Multi-Option Descending Clock Auction: (Extended Abstract). | 0 | 0.34 | 2016 |
| Sequential Planning for Steering Immune System Adaptation. | 1 | 0.36 | 2016 |
| Strategy-Based Warm Starting for Regret Minimization in Games. | 7 | 0.53 | 2016 |
| Sample Complexity of Automated Mechanism Design. | 5 | 0.54 | 2016 |
| Efficiency and Budget Balance. | 1 | 0.38 | 2016 |
| Computational Bundling for Auctions | 1 | 0.37 | 2015 |
| Tartanian7: A Champion Two-Player No-Limit Texas Hold'Em Poker-Playing Program | 0 | 0.34 | 2015 |
| Discretization of Continuous Action Spaces in Extensive-Form Games | 2 | 0.39 | 2015 |
| Abstraction For Solving Large Incomplete-Information Games | 7 | 0.50 | 2015 |
| Limited Lookahead in Imperfect-Information Games | 2 | 0.41 | 2015 |
| Automated Design of Revenue-Maximizing Combinatorial Auctions | 6 | 0.53 | 2015 |
| Steering Evolution Strategically: Computational Game Theory And Opponent Exploitation For Treatment Planning, Drug Design, And Synthetic Biology | 1 | 0.35 | 2015 |
| Finding the pareto curve in bimatrix games is easy. | 0 | 0.34 | 2014 |
| Algorithms for closed under rational behavior (CURB) sets | 5 | 0.58 | 2014 |
| Action translation in extensive-form games with large action spaces: axioms, paradoxes, and the pseudo-harmonic mapping | 6 | 0.49 | 2013 |
| Mixed-bundling auctions with reserve prices | 9 | 0.62 | 2012 |
| Optimizing kidney exchange with transplant chains: theory and reality | 34 | 2.27 | 2012 |
| Strategy purification and thresholding: effective non-equilibrium approaches for playing large games | 0 | 0.34 | 2012 |
| Approximating optimal combinatorial auctions for complements using restricted welfare maximization | 4 | 0.52 | 2011 |
| Automated Market Makers That Enable New Settings: Extending Constant-Utility Cost Functions. | 5 | 0.49 | 2011 |
| Inventory-Based Versus Prior-Based Options Trading Agents | 1 | 0.37 | 2011 |
| Information-theoretic approaches to branching in search | 7 | 0.60 | 2011 |
| Speeding up gradient-based algorithms for sequential games | 2 | 0.40 | 2010 |
