About
Pioneering AI Defense Solutions
Strategy Robot, Inc. is a Carnegie Mellon University Computer Science Department spinout company located in Pittsburgh, Pennsylvania. Founded in 2018 by eminent professor and successful serial entrepreneur Dr. Tuomas Sandholm, Strategy Robot is a DoD-focused AI software product company. Over $45M has been invested over 19 years in this R&D.
Strategy Robot has the only superhuman AI technologies for generating game-theoretically sound strategies. We have won the AI-vs-AI world championships multiple times in a row. Furthermore, our AIs have been proven to be superhuman in the main benchmark in the field, namely no-limit Texas hold’em—both in the two-player setting [Science 2018] and the multi-player setting [Science 2019]. The latter is the only superhuman AI gaming milestone in any game beyond two-player zero-sum games. More recently, our AIs have proven superhuman in extensive quantitative DoD evaluations on course-of-action generation and other defense applications.
Current Customers
Combatant Commands
Services
Pentagon
4th Estate
Defense contractors
Consulting firms
Our Values
Excellence
We focus on doing things at which we are the best in the world.
Customer Focus
Customers come first.
Honesty and Trust
We have the AIs that we say we have. We do what we say.
Awards
Minsky Medal (sometimes called the Nobel Prize of AI; only awarded twice in history, once to Google DeepMind and once to us).
IJCAI John McCarthy Award (awarded to one leading AI researcher in the world per year). “For his significant research contributions to multiagent systems, computational economics, optimization and game playing, and their application in real-world settings.” Award talk “Developing and Using Superhuman AIs: What can Humans Contribute?”
Robert S. Engelmore Award (the leading award in applied AI). “For outstanding research contributions in Artificial Intelligence, its application to electronic marketplaces, the highly original use of AI in strategic multi-player games, and the application of AI to optimize organ exchanges.” Award talk “What Can and Should Humans Contribute to Superhuman AI”.
Science breakthrough of the Year Finalist twice (by Science, the leading journal across the sciences).
Science Breakthrough of the Year (by La Recherche).
Annual Supercomputing Award twice, Supercomputing Conference (SC).
IJCAI Computers and Thought Award (awarded to one AI researcher per year in the world).
Inaugural ACM Autonomous Agents Research Award.
CMU’s Allen Newell Award for Research Excellence.
Sloan Fellowship.
NSF Career Award.
Edelman Laureateship.
Fellow of the ACM.
AAAI Fellow.
INFORMS Fellow.
American Association for the Advancement of Science (AAAS) Fellow.
Carnegie Science Center Award for Excellence.
100 Most Intriguing Entrepreneurs award from Goldman Sachs, 2020.
Honorary Doctorate from the University of Zurich.
Engineering Project of the Year Innovation Award “GT-Metro: Game-Theoretic Scheduling of Metro Security Patrols”.
Awards for papers and PhD dissertations
Influential Paper Award: International Foundation for Autonomous Agents and Multi-Agent Systems (IFAAMAS), 2022. For the paper “Computing the optimal strategy to commit to” in Proceedings of the 7th ACM Conference on Electronic Commerce (EC), pp 82--90, 2006. Citation: “This paper established the algorithmic foundations for the field of Stackelberg security games, including its more recent Green Security Games incarnation. The paper asks a fundamental question: what is the computational complexity of the problem of commitment to either a pure or a mixed strategy in a Stackelberg game, considering both complete and incomplete information? It set the basis for computing optimal leader strategies in security games which have led to much impactful work with real-world applications and has helped establish a strong mechanism design community within AAMAS, and beyond.”
AAAI/ACM SIGAI Dissertation Award
International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS) Victor Lesser Distinguished Dissertation award (three times)
CMU School of Computer Science Distinguished Dissertation Award
“Superhuman AI for Multiplayer Poker” was selected to be presented in the special plenary session on Highlights Beyond EC, at the ACM Conference on Economics and Computation (EC), 2020.
“Solving Imperfect-Information Games with Discounted Counterfactual Regret Minimization” was selected for an Outstanding Paper Honorable Mention at the Association for the Advancement of Artificial Intelligence Annual Conference (AAAI), 2019. (1 of 4 papers receiving recognition out of 1,150 accepted papers and 7,095 submissions.)
“Safe and Nested Subgame Solving for Imperfect-Information Games” was selected to be one of the three papers for at the inaugural annual AGT Fest, 2018. These are top Algorithmic Game Theory papers from other conferences and journals that get presented in a special plenary session at the ACM Conference on Economics and Computation (EC).
“Safe and Nested Subgame Solving for Imperfect-Information Games” won a Best Paper Award at the Neural Information Processing Systems: Natural and Synthetic (NIPS) conference, 2017. (It was one of three best paper awards, out of 678 accepted papers and 3,240 submissions.)
“Faster algorithms for extensive-form game solving via improved smoothing functions” won runner-up status in INFORMS Computing Society's 2017 INFORMS Student Paper Competition.
“Safe Opponent Exploitation” from the ACM Conference on Electronic Commerce (EC) 2012 was invited to the “Best of EC-12" Special Issue of the journal ACM Transactions on Economics and Computation (TEAC).
“TRUSTS: Scheduling Randomized Patrols for Fare Inspection in Transit Systems” from the Innovative Applications of Artificial Intelligence (IAAI) conference 2012 was invited by the conference chair to the AI Magazine special issue on the best papers from that conference.
“New Complexity Results about Nash Equilibria” was highlighted on the web site of the journal Games and Economic Behavior as one of the most highly cited papers in that journal.
“Computing an Approximate Jam/Fold Equilibrium for 3-Agent No-Limit Texas Hold'em Tournaments” was one of six finalists for Best Student Paper Award at the International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 2008.
“Better automated abstraction techniques for imperfect information games, with application to Texas Hold'em poker” was Best Paper Award Runner-Up at the International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 2007.
“A Technique for Reducing Normal Form Games to Compute a Nash Equilibrium” was selected as a runner-up for the Best Student Paper award of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS), Hakodate, Japan, May, 2006.
One of the three honorable mentions in the ACM Distinguished Dissertation Award competition.
“A New Solution Concept for Coalitional Games in Open Anonymous Environments” won a Best Paper Award at the 19th Annual Conference of the Japan Society on Artificial Intelligence (JSAI), 2005.