Sam Ganzfried


National Security


Sam Ganzfried. 2020. Computing Nash Equilibria in Multiplayer DAG-Structured Stochastic Games with Persistent Imperfect Information.


Sam Ganzfried. 2020. Algorithm for Computing Approximate Nash equilibrium in Continuous Games with Application to Continuous Blotto.


Sam Ganzfried, Conner Laughlin, and Charles Morefield. 2020. Parallel Algorithm for Approximating Nash Equilibrium in Multiplayer Stochastic Games with Application to Naval Strategic Planning. In Proceedings of the AAAI Spring Symposium on Deep Models and Artificial Intelligence for Defense Applications: Potentials, Theories, Practices, Tools, and Risks.


Education and Assessment

Sam Ganzfried and Farzana Yusuf. 2018. Optimal Weighting for Exam Composition. Education Sciences 8(1), 36, special issue "Artificial Intelligence and Education."


Sam Ganzfried and Farzana Yusuf. 2019. Optimal Number of Choices in Rating Contexts. Big Data and Cognitive Computing, 3(3), 48. Special Issue on Computational Models of Cognition and Learning. Early version at NIPS Workshop on Imperfect Decision Makers: Admitting Real-World Rationality.


Hurricane Prediction

Max Chiswick and Sam Ganzfried. 2020. Prediction of Bayesian Intervals for Tropical Storms. In Proceedings of the Florida Artificial Intelligence Research Society Conference (FLAIRS). Short version in Proceedings of the 2020 ICLR Workshop Tackling Climate Change with Machine Learning. 


Sheila Alemany, Jonathan Beltran, Adrian Perez, and Sam Ganzfried. 2019. Predicting Hurricane Trajectories using a Recurrent Neural Network. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI).  


Stochastic Games


Sam Ganzfried. 2020. Computing Nash Equilibria in Multiplayer DAG-Structured Stochastic Games with Persistent Imperfect Information.


Sam Ganzfried, Conner Laughlin, and Charles Morefield. 2020. Parallel Algorithm for Approximating Nash Equilibrium in Multiplayer Stochastic Games with Application to Naval Strategic Planning. In Proceedings of the AAAI Spring Symposium on Deep Models and Artificial Intelligence for Defense Applications: Potentials, Theories, Practices, Tools, and Risks.


Sam Ganzfried and Tuomas Sandholm. 2009. Computing Equilibria in Multiplayer Stochastic Games of Imperfect Information. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI).


Sam Ganzfried and Tuomas Sandholm. 2008. Computing an Approximate Jam/Fold Equilibrium for 3-Player No-Limit Texas Hold'em Tournaments. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS).


Continuous Games


Sam Ganzfried. 2020. Algorithm for Computing Approximate Nash equilibrium in Continuous Games with Application to Continuous Blotto.


Sam Ganzfried and Tuomas Sandholm. 2010. Computing Equilibria by Incorporating Qualitative Models. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS).


Opponent Modeling


Sam Ganzfried. Mistakes in Games. 2019. In Proceedings of the International Conference on Distributed Artificial Intelligence (DAI).


Sam Ganzfried and Qingyun Sun. 2018. Bayesian Opponent Exploitation in Imperfect-Information Games. In Proceedings of the Conference on Computational Intelligence and Games (CIG).


Sam Ganzfried and Tuomas Sandholm. 2015. Safe Opponent Exploitation. ACM Transactions on Economics and Computation (TEAC), 3(2), 8:1-28. Early version in Proceedings of the 2012 ACM Conference on Electronic Commerce (EC).


Sam Ganzfried and Tuomas Sandholm. 2011. Game Theory-Based Opponent Modeling in Large Imperfect-Information Games. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS).


Human-Understandable Strategies


Sam Ganzfried and Max Chiswick. 2020. Most Important Fundamental Rule of Poker Strategy. In Proceedings of the Florida Artificial Intelligence Research Society Conference (FLAIRS).


Sam Ganzfried and Farzana Yusuf. 2017. Computing Human-Understandable Strategies: Deducing Fundamental Rules of Poker Strategy. Invited feature article at Games, 8(4), 49.


Sam Ganzfried and Tuomas Sandholm. 2010. Computing Equilibria by Incorporating Qualitative Models. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS).


Game Abstraction


Noam Brown*, Sam Ganzfried*, and Tuomas Sandholm. 2015. Hierarchical Abstraction, Distributed Equilibrium Computation, and Post-Processing, with Application to a Champion No-Limit Texas Hold'em Agent. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS). *Listed alphabetically.


Sam Ganzfried and Tuomas Sandholm. 2014. Potential-Aware Imperfect-Recall Abstraction with Earth Mover's Distance in Imperfect-Information Games. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI).


Sam Ganzfried, Tuomas Sandholm, and Kevin Waugh. 2012. Strategy Purification and Thresholding: Effective Non-Equilibrium Approaches for Playing Large Games. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS).


Endgame Solving


Sam Ganzfried and Tuomas Sandholm. 2015. Endgame Solving in Large Imperfect-Information Games. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS).


Multiplayer Games


Sam Ganzfried. 2020. Fast Complete Algorithm for Multiplayer Nash Equilibrium.


Sam Ganzfried. 2020. Fictitious Play Outperforms Counterfactual Regret Minimization.


Sam Ganzfried. 2020. Computing Nash Equilibria in Multiplayer DAG-Structured Stochastic Games with Persistent Imperfect Information.

Sam Ganzfried, Conner Laughlin, and Charles Morefield. 2020. Parallel Algorithm for Approximating Nash Equilibrium in Multiplayer Stochastic Games with Application to Naval Strategic Planning. In Proceedings of the AAAI Spring Symposium on Deep Models and Artificial Intelligence for Defense Applications: Potentials, Theories, Practices, Tools, and Risks.


Sam Ganzfried, Austin Nowak, and Joannier Pinales. 2018. Successful Nash Equilibrium Agent for a Three-Player Imperfect-Information Game. Feature article at Games, 9(2), 33.


Sam Ganzfried and Tuomas Sandholm. 2009. Computing Equilibria in Multiplayer Stochastic Games of Imperfect Information. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI).

Sam Ganzfried and Tuomas Sandholm. 2008. Computing an Approximate Jam/Fold Equilibrium for 3-Player No-Limit Texas Hold'em Tournaments. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS).