Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDTuomas Sandholm
Person information
- affiliation: Carnegie Mellon University, Pittsburgh, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[c279]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent. AAAI 2021: 5363-5371- [c278]Gabriele Farina, Robin Schmucker, Tuomas Sandholm:
Bandit Linear Optimization for Sequential Decision Making and Extensive-Form Games. AAAI 2021: 5372-5380 - [c277]Gabriele Farina, Tuomas Sandholm:
Model-Free Online Learning in Unknown Sequential Decision Making Problems and Games. AAAI 2021: 5381-5390 - [c276]Brian Hu Zhang, Tuomas Sandholm:
Finding and Certifying (Near-)Optimal Strategies in Black-Box Extensive-Form Games. AAAI 2021: 5779-5788 - [c275]Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik:
Generalization in Portfolio-Based Algorithm Selection. AAAI 2021: 12225-12232 - [c274]Gabriele Farina, Andrea Celli, Nicola Gatti, Tuomas Sandholm:
Connecting Optimal Ex-Ante Collusion in Teams to Extensive-Form Correlation: Faster Algorithms and Positive Complexity Results. ICML 2021: 3164-3173 - [c273]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Better Regularization for Sequential Decision Spaces: Fast Convergence Rates for Nash, Correlated, and Team Equilibria. EC 2021: 432 - [c272]Maria-Florina Balcan, Dan F. DeBlasio, Travis Dick, Carl Kingsford, Tuomas Sandholm, Ellen Vitercik:
How much data is sufficient to learn high-performing algorithms? generalization guarantees for data-driven algorithm design. STOC 2021: 919-932 - [i72]Gabriele Farina, Tuomas Sandholm:
Model-Free Online Learning in Unknown Sequential Decision Making Problems and Games. CoRR abs/2103.04539 (2021) - [i71]Gabriele Farina, Robin Schmucker, Tuomas Sandholm:
Bandit Linear Optimization for Sequential Decision Making and Extensive-Form Games. CoRR abs/2103.04546 (2021) - [i70]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Better Regularization for Sequential Decision Spaces: Fast Convergence Rates for Nash, Correlated, and Team Equilibria. CoRR abs/2105.12954 (2021) - [i69]Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik:
Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond. CoRR abs/2106.04033 (2021) - [i68]Brian Hu Zhang, Tuomas Sandholm:
Subgame solving without common knowledge. CoRR abs/2106.06068 (2021) - 2020
- [j52]Christian Kroer, Tuomas Sandholm:
Limited lookahead in imperfect-information games. Artif. Intell. 283: 103218 (2020) - [j51]Eleonora Braggion, Nicola Gatti, Roberto Lucchetti, Tuomas Sandholm, Bernhard von Stengel:
Strong Nash equilibria and mixed strategies. Int. J. Game Theory 49(3): 699-710 (2020) - [j50]Avrim Blum
, John P. Dickerson, Nika Haghtalab, Ariel D. Procaccia, Tuomas Sandholm, Ankit Sharma:
Ignorance Is Almost Bliss: Near-Optimal Stochastic Matching with Few Queries. Oper. Res. 68(1): 16-34 (2020) - [j49]Christian Kroer, Kevin Waugh, Fatma Kilinç-Karzan, Tuomas Sandholm:
Faster algorithms for extensive-form game solving via improved smoothing functions. Math. Program. 179(1): 385-417 (2020) - [c271]Gabriele Farina, Tommaso Bianchi, Tuomas Sandholm:
Coarse Correlation in Extensive-Form Games. AAAI 2020: 1934-1941 - [c270]Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik:
Learning to Optimize Computational Resources: Frugal Training with Generalization Guarantees. AAAI 2020: 3227-3234 - [c269]Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik:
Refined bounds for algorithm configuration: The knife-edge of dual class approximability. ICML 2020: 580-590 - [c268]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Stochastic Regret Minimization in Extensive-Form Games. ICML 2020: 3018-3028 - [c267]Brian Hu Zhang, Tuomas Sandholm:
Sparsified Linear Programming for Zero-Sum Equilibrium Finding. ICML 2020: 11256-11267 - [c266]Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm:
Efficient Algorithms for Learning Revenue-Maximizing Two-Part Tariffs. IJCAI 2020: 332-338 - [c265]Gabriele Farina, Tuomas Sandholm:
Polynomial-Time Computation of Optimal Correlated Equilibria in Two-Player Extensive-Form Games with Public Chance Moves and Beyond. NeurIPS 2020 - [c264]Duncan C. McElfresh, Michael J. Curry, Tuomas Sandholm, John Dickerson:
Improving Policy-Constrained Kidney Exchange via Pre-Screening. NeurIPS 2020 - [c263]Brian Hu Zhang, Tuomas Sandholm:
Small Nash Equilibrium Certificates in Very Large Games. NeurIPS 2020 - [i67]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Stochastic Regret Minimization in Extensive-Form Games. CoRR abs/2002.08493 (2020) - [i66]Carlos Martin, Tuomas Sandholm:
Efficient exploration of zero-sum stochastic games. CoRR abs/2002.10524 (2020) - [i65]Brian Hu Zhang, Tuomas Sandholm:
Sparsified Linear Programming for Zero-Sum Equilibrium Finding. CoRR abs/2006.03451 (2020) - [i64]Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik:
Refined bounds for algorithm configuration: The knife-edge of dual class approximability. CoRR abs/2006.11827 (2020) - [i63]Brian Hu Zhang, Tuomas Sandholm:
Small Nash Equilibrium Certificates in Very Large Games. CoRR abs/2006.16387 (2020) - [i62]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent. CoRR abs/2007.14358 (2020) - [i61]Gabriele Farina, Tuomas Sandholm:
Polynomial-Time Computation of Optimal Correlated Equilibria in Two-Player Extensive-Form Games with Public Chance Moves and Beyond. CoRR abs/2009.04336 (2020) - [i60]Brian Hu Zhang, Tuomas Sandholm:
Finding and Certifying (Near-)Optimal Strategies in Black-Box Extensive-Form Games. CoRR abs/2009.07384 (2020) - [i59]Gabriele Farina, Andrea Celli, Nicola Gatti, Tuomas Sandholm:
Faster Algorithms for Optimal Ex-Ante Coordinated Collusive Strategies in Extensive-Form Zero-Sum Games. CoRR abs/2009.10061 (2020) - [i58]Duncan C. McElfresh, Michael J. Curry, Tuomas Sandholm, John P. Dickerson:
Improving Policy-Constrained Kidney Exchange via Pre-Screening. CoRR abs/2010.12069 (2020) - [i57]Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik:
Generalization in portfolio-based algorithm selection. CoRR abs/2012.13315 (2020)
2010 – 2019
- 2019
- [j48]Swaprava Nath, Tuomas Sandholm:
Efficiency and budget balance in general quasi-linear domains. Games Econ. Behav. 113: 673-693 (2019) - [j47]John P. Dickerson, Ariel D. Procaccia, Tuomas Sandholm:
Failure-Aware Kidney Exchange. Manag. Sci. 65(4): 1768-1791 (2019) - [c262]Noam Brown, Tuomas Sandholm:
Solving Imperfect-Information Games via Discounted Regret Minimization. AAAI 2019: 1829-1836 - [c261]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Online Convex Optimization for Sequential Decision Processes and Extensive-Form Games. AAAI 2019: 1917-1925 - [c260]Alberto Marchesi, Gabriele Farina, Christian Kroer, Nicola Gatti, Tuomas Sandholm:
Quasi-Perfect Stackelberg Equilibrium. AAAI 2019: 2117-2124 - [c259]Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik:
Estimating Approximate Incentive Compatibility. EC 2019: 867 - [c258]Noam Brown, Adam Lerer, Sam Gross, Tuomas Sandholm:
Deep Counterfactual Regret Minimization. ICML 2019: 793-802 - [c257]Gabriele Farina, Christian Kroer, Noam Brown, Tuomas Sandholm:
Stable-Predictive Optimistic Counterfactual Regret Minimization. ICML 2019: 1853-1862 - [c256]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Regret Circuits: Composability of Regret Minimizers. ICML 2019: 1863-1872 - [c255]Gabriele Farina, Chun Kai Ling, Fei Fang, Tuomas Sandholm:
Efficient Regret Minimization Algorithm for Extensive-Form Correlated Equilibrium. NeurIPS 2019: 5187-5197 - [c254]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Optimistic Regret Minimization for Extensive-Form Games via Dilated Distance-Generating Functions. NeurIPS 2019: 5222-5232 - [c253]Gabriele Farina, Chun Kai Ling, Fei Fang, Tuomas Sandholm:
Correlation in Extensive-Form Games: Saddle-Point Formulation and Benchmarks. NeurIPS 2019: 9229-9239 - [i56]Gabriele Farina, Christian Kroer, Noam Brown, Tuomas Sandholm:
Stable-Predictive Optimistic Counterfactual Regret Minimization. CoRR abs/1902.04982 (2019) - [i55]Christian Kroer, Tuomas Sandholm:
Limited Lookahead in Imperfect-Information Games. CoRR abs/1902.06335 (2019) - [i54]Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik:
Estimating Approximate Incentive Compatibility. CoRR abs/1902.09413 (2019) - [i53]Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik:
Learning to Optimize Computational Resources: Frugal Training with Generalization Guarantees. CoRR abs/1905.10819 (2019) - [i52]Gabriele Farina, Chun Kai Ling, Fei Fang, Tuomas Sandholm:
Correlation in Extensive-Form Games: Saddle-Point Formulation and Benchmarks. CoRR abs/1905.12564 (2019) - [i51]Maria-Florina Balcan, Dan F. DeBlasio, Travis Dick, Carl Kingsford, Tuomas Sandholm, Ellen Vitercik:
How much data is sufficient to learn high-performing algorithms? CoRR abs/1908.02894 (2019) - [i50]Gabriele Farina, Tommaso Bianchi, Tuomas Sandholm:
Coarse Correlation in Extensive-Form Games. CoRR abs/1908.09893 (2019) - [i49]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Optimistic Regret Minimization for Extensive-Form Games via Dilated Distance-Generating Functions. CoRR abs/1910.10906 (2019) - [i48]Gabriele Farina, Chun Kai Ling, Fei Fang, Tuomas Sandholm:
Efficient Regret Minimization Algorithm for Extensive-Form Correlated Equilibrium. CoRR abs/1910.12450 (2019) - 2018
- [c252]Christian Kroer, Gabriele Farina, Tuomas Sandholm:
Robust Stackelberg Equilibria in Extensive-Form Games and Extension to Limited Lookahead. AAAI Workshops 2018: 294-301 - [c251]Christian Kroer, Gabriele Farina, Tuomas Sandholm:
Robust Stackelberg Equilibria in Extensive-Form Games and Extension to Limited Lookahead. AAAI 2018: 1130-1137 - [c250]Maria-Florina Balcan, Travis Dick, Tuomas Sandholm, Ellen Vitercik:
Learning to Branch. ICML 2018: 353-362 - [c249]Gabriele Farina, Alberto Marchesi, Christian Kroer, Nicola Gatti, Tuomas Sandholm:
Trembling-Hand Perfection in Extensive-Form Games with Commitment. IJCAI 2018: 233-239 - [c248]Christian Kroer, Tuomas Sandholm:
A Unified Framework for Extensive-Form Game Abstraction with Bounds. NeurIPS 2018: 613-624 - [c247]Christian Kroer, Gabriele Farina, Tuomas Sandholm:
Solving Large Sequential Games with the Excessive Gap Technique. NeurIPS 2018: 872-882 - [c246]Gabriele Farina, Nicola Gatti, Tuomas Sandholm:
Practical exact algorithm for trembling-hand equilibrium refinements in games. NeurIPS 2018: 5044-5054 - [c245]Noam Brown, Tuomas Sandholm, Brandon Amos:
Depth-Limited Solving for Imperfect-Information Games. NeurIPS 2018: 7674-7685 - [c244]Gabriele Farina, Andrea Celli, Nicola Gatti, Tuomas Sandholm:
Ex ante coordination and collusion in zero-sum multi-player extensive-form games. NeurIPS 2018: 9661-9671 - [c243]Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik:
A General Theory of Sample Complexity for Multi-Item Profit Maximization. EC 2018: 173-174 - [i47]Maria-Florina Balcan, Travis Dick, Tuomas Sandholm, Ellen Vitercik:
Learning to Branch. CoRR abs/1803.10150 (2018) - [i46]Noam Brown, Tuomas Sandholm, Brandon Amos:
Depth-Limited Solving for Imperfect-Information Games. CoRR abs/1805.08195 (2018) - [i45]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Online Convex Optimization for Sequential Decision Processes and Extensive-Form Games. CoRR abs/1809.03075 (2018) - [i44]Noam Brown, Tuomas Sandholm:
Solving Imperfect-Information Games via Discounted Regret Minimization. CoRR abs/1809.04040 (2018) - [i43]Christian Kroer, Gabriele Farina, Tuomas Sandholm:
Solving Large Sequential Games with the Excessive Gap Technique. CoRR abs/1810.03063 (2018) - [i42]Noam Brown, Adam Lerer, Sam Gross, Tuomas Sandholm:
Deep Counterfactual Regret Minimization. CoRR abs/1811.00164 (2018) - [i41]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Composability of Regret Minimizers. CoRR abs/1811.02540 (2018) - [i40]Alberto Marchesi, Gabriele Farina, Christian Kroer, Nicola Gatti, Tuomas Sandholm:
Quasi-Perfect Stackelberg Equilibrium. CoRR abs/1811.03871 (2018) - 2017
- [j46]John P. Dickerson, Tuomas Sandholm:
Multi-Organ Exchange. J. Artif. Intell. Res. 60: 639-679 (2017) - [c242]Kimmo Berg, Tuomas Sandholm:
Exclusion Method for Finding Nash Equilibrium in Multiplayer Games. AAAI 2017: 383-389 - [c241]Noam Brown, Christian Kroer, Tuomas Sandholm:
Dynamic Thresholding and Pruning for Regret Minimization. AAAI 2017: 421-429 - [c240]Noam Brown, Tuomas Sandholm:
Reduced Space and Faster Convergence in Imperfect-Information Games via Regret-Based Pruning. AAAI Workshops 2017 - [c239]Noam Brown, Tuomas Sandholm:
Safe and Nested Endgame Solving for Imperfect-Information Games. AAAI Workshops 2017 - [c238]John P. Dickerson, Aleksandr M. Kazachkov, Ariel D. Procaccia, Tuomas Sandholm:
Small Representations of Big Kidney Exchange Graphs. AAAI 2017: 487-493 - [c237]John P. Dickerson, Aleksandr M. Kazachkov, Ariel D. Procaccia, Tuomas Sandholm:
Small Representations of Big Kidney Exchange Graphs. AAAI Workshops 2017 - [c236]Gabriele Farina, John P. Dickerson, Tuomas Sandholm:
Inter-Club Kidney Exchange. AAAI Workshops 2017 - [c235]Noam Brown, Tuomas Sandholm:
Reduced Space and Faster Convergence in Imperfect-Information Games via Pruning. ICML 2017: 596-604 - [c234]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Regret Minimization in Behaviorally-Constrained Zero-Sum Games. ICML 2017: 1107-1116 - [c233]Tuomas Sandholm:
Super-Human AI for Strategic Reasoning: Beating Top Pros in Heads-Up No-Limit Texas Hold'em. IJCAI 2017: 24-25 - [c232]Gabriele Farina, John P. Dickerson, Tuomas Sandholm:
Operation Frames and Clubs in Kidney Exchange. IJCAI 2017: 199-205 - [c231]Christian Kroer, Gabriele Farina, Tuomas Sandholm:
Smoothing Method for Approximate Extensive-Form Perfect Equilibrium. IJCAI 2017: 295-301 - [c230]Noam Brown, Tuomas Sandholm:
Libratus: The Superhuman AI for No-Limit Poker. IJCAI 2017: 5226-5228 - [c229]Noam Brown, Tuomas Sandholm:
Safe and Nested Subgame Solving for Imperfect-Information Games. NIPS 2017: 689-699 - [c228]Christian Kroer, Kevin Waugh, Fatma Kilinç-Karzan, Tuomas Sandholm:
Theoretical and Practical Advances on Smoothing for Extensive-Form Games. EC 2017: 693 - [i39]Christian Kroer, Kevin Waugh, Fatma Kilinç-Karzan, Tuomas Sandholm:
Theoretical and Practical Advances on Smoothing for Extensive-Form Games. CoRR abs/1702.04849 (2017) - [i38]Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik:
Sample Complexity of Multi-Item Profit Maximization. CoRR abs/1705.00243 (2017) - [i37]Noam Brown, Tuomas Sandholm:
Safe and Nested Subgame Solving for Imperfect-Information Games. CoRR abs/1705.02955 (2017) - [i36]Christian Kroer, Gabriele Farina, Tuomas Sandholm:
Smoothing Method for Approximate Extensive-Form Perfect Equilibrium. CoRR abs/1705.09326 (2017) - [i35]Gabriele Farina, John P. Dickerson, Tuomas Sandholm:
Operation Frames and Clubs in Kidney Exchange. CoRR abs/1705.09328 (2017) - [i34]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Regret Minimization in Behaviorally-Constrained Zero-Sum Games. CoRR abs/1711.03441 (2017) - [i33]Nicola Gatti, Marco Rocco, Tuomas Sandholm:
On the Verification and Computation of Strong Nash Equilibrium. CoRR abs/1711.06318 (2017) - [i32]Christian Kroer, Gabriele Farina, Tuomas Sandholm:
Robust Stackelberg Equilibria in Extensive-Form Games and Extension to Limited Lookahead. CoRR abs/1711.08080 (2017) - 2016
- [c227]Noam Brown, Tuomas Sandholm:
Strategy-Based Warm Starting for Regret Minimization in Games. AAAI 2016: 432-438 - [c226]Benjamin Plaut, John P. Dickerson, Tuomas Sandholm:
Fast Optimal Clearing of Capped-Chain Barter Exchanges. AAAI 2016: 601-607 - [c225]Kimmo Berg, Tuomas Sandholm:
Exclusion Method for Finding Nash Equilibrium in Multi-Player Games: (Extended Abstract). AAMAS 2016: 1417-1418 - [c224]Tri-Dung Nguyen, Tuomas Sandholm:
Multi-Option Descending Clock Auction: (Extended Abstract). AAMAS 2016: 1461-1462 - [c223]Fei Peng, Tuomas Sandholm:
Scalable Segment Abstraction Method for Advertising Campaign Admission and Inventory Allocation Optimization. IJCAI 2016: 655-661 - [c222]Christian Kroer, Tuomas Sandholm:
Sequential Planning for Steering Immune System Adaptation. IJCAI 2016: 3177-3184 - [c221]Noam Brown, Tuomas Sandholm:
Baby Tartanian8: Winning Agent from the 2016 Annual Computer Poker Competition. IJCAI 2016: 4238-4239 - [c220]Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik:
Sample Complexity of Automated Mechanism Design. NIPS 2016: 2083-2091 - [c219]John P. Dickerson, David F. Manlove, Benjamin Plaut, Tuomas Sandholm, James Trimble:
Position-Indexed Formulations for Kidney Exchange. EC 2016: 25-42 - [c218]Christian Kroer, Tuomas Sandholm:
Imperfect-Recall Abstractions with Bounds in Games. EC 2016: 459-476 - [c217]Swaprava Nath, Tuomas Sandholm:
Efficiency and Budget Balance. WINE 2016: 369-383 - [i31]John P. Dickerson, Aleksandr M. Kazachkov, Ariel D. Procaccia, Tuomas Sandholm:
Small Representations of Big Kidney Exchange Graphs. CoRR abs/1605.07728 (2016) - [i30]Benjamin Plaut, John P. Dickerson, Tuomas Sandholm:
Hardness of the Pricing Problem for Chains in Barter Exchanges. CoRR abs/1606.00117 (2016) - [i29]John P. Dickerson, David F. Manlove, Benjamin Plaut, Tuomas Sandholm, James Trimble:
Position-Indexed Formulations for Kidney Exchange. CoRR abs/1606.01623 (2016) - [i28]Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik:
Sample Complexity of Automated Mechanism Design. CoRR abs/1606.04145 (2016) - [i27]Noam Brown, Tuomas Sandholm:
Reduced Space and Faster Convergence in Imperfect-Information Games via Regret-Based Pruning. CoRR abs/1609.03234 (2016) - [i26]Swaprava Nath, Tuomas Sandholm:
Efficiency and Budget Balance in General Quasi-linear Domains. CoRR abs/1610.01443 (2016) - 2015
- [j45]Tuomas Sandholm, Anton Likhodedov:
Automated Design of Revenue-Maximizing Combinatorial Auctions. Oper. Res. 63(5): 1000-1025 (2015) - [j44]Sam Ganzfried, Tuomas Sandholm:
Safe Opponent Exploitation. ACM Trans. Economics and Comput. 3(2): 8:1-8:28 (2015) - [c216]John P. Dickerson, Tuomas Sandholm:
FutureMatch: Combining Human Value Judgments and Machine Learning to Match in Dynamic Environments. AAAI 2015: 622-628 - [c215]Chen Hajaj, John P. Dickerson, Avinatan Hassidim, Tuomas Sandholm, David Sarne:
Strategy-Proof and Efficient Kidney Exchange Using a Credit Mechanism. AAAI 2015: 921-928 - [c214]Tuomas Sandholm:
Steering Evolution Strategically: Computational Game Theory and Opponent Exploitation for Treatment Planning, Drug Design, and Synthetic Biology. AAAI 2015: 4057-4061 - [c213]Noam Brown, Sam Ganzfried, Tuomas Sandholm:
Tartanian7: A Champion Two-Player No-Limit Texas Hold'em Poker-Playing Program. AAAI 2015: 4270-4271 - [c212]Noam Brown, Sam Ganzfried, Tuomas Sandholm:
Hierarchical Abstraction, Distributed Equilibrium Computation, and Post-Processing, with Application to a Champion No-Limit Texas Hold'em Agent. AAAI Workshop: Computer Poker and Imperfect Information 2015 - [c211]Sam Ganzfried, Tuomas Sandholm:
Endgame Solving in Large Imperfect-Information Games. AAAI Workshop: Computer Poker and Imperfect Information 2015 - [c210]Tuomas Sandholm:
Abstraction for Solving Large Incomplete-Information Games. AAAI 2015: 4127-4131 - [c209]Noam Brown, Sam Ganzfried, Tuomas Sandholm:
Hierarchical Abstraction, Distributed Equilibrium Computation, and Post-Processing, with Application to a Champion No-Limit Texas Hold'em Agent. AAMAS 2015: 7-15 - [c208]Sam Ganzfried, Tuomas Sandholm:
Endgame Solving in Large Imperfect-Information Games. AAMAS 2015: 37-45 - [c207]Christian Kroer, Tuomas Sandholm:
Discretization of Continuous Action Spaces in Extensive-Form Games. AAMAS 2015: 47-56 - [c206]Christian Kroer, Tuomas Sandholm:
Computational Bundling for Auctions. AAMAS 2015: 317-326 - [c205]Noam Brown,