default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSam Ganzfried
Person information
- affiliation: Florida International University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c32]Sam Ganzfried:
Fast Complete Algorithm for Multiplayer Nash Equilibrium. GameSec 2024: 109-123- 2023
- [c31]Sam Ganzfried:
Safe Equilibrium. CDC 2023: 5230-5236 - [c30]Sam Ganzfried:
Observable Perfect Equilibrium. GameSec 2023: 3-22 - [i25]Sam Ganzfried:
Nonparametric Strategy Test. CoRR abs/2312.10695 (2023) - 2022
- [c29]Sam Ganzfried:
Fictitious Play with Maximin Initialization. CDC 2022: 4425-4430 - [c28]Sam Ganzfried:
Best Response Computation in Multiplayer Imperfect-Information Stochastic Games. FLAIRS 2022 - [i24]Sam Ganzfried:
Safe Equilibrium. CoRR abs/2201.04266 (2022) - [i23]Sam Ganzfried:
Fictitious Play with Maximin Initialization. CoRR abs/2203.10774 (2022) - [i22]Sam Ganzfried:
Stable Relationships. CoRR abs/2206.06468 (2022) - [i21]Sam Ganzfried:
Observable Perfect Equilibrium. CoRR abs/2210.16506 (2022) - [i20]Sam Ganzfried, Kevin A. Wang, Max Chiswick:
Bayesian Opponent Modeling in Multiplayer Imperfect-Information Games. CoRR abs/2212.06027 (2022) - 2021
- [j8]Sam Ganzfried:
Algorithm for Computing Approximate Nash Equilibrium in Continuous Games with Application to Continuous Blotto. Games 12(2): 47 (2021) - [c27]Sam Ganzfried:
Computing Nash Equilibria in Multiplayer DAG-Structured Stochastic Games with Persistent Imperfect Information. GameSec 2021: 3-16 - [i19]Sam Ganzfried:
Human strategic decision making in parametrized games. CoRR abs/2104.14744 (2021) - 2020
- [c26]Sam Ganzfried, Conner Laughlin, Charles Morefield
:
Parallel Algorithm for Nash Equilibrium in Multiplayer Stochastic Games with Application to Naval Strategic Planning. DAI 2020: 1-13 - [c25]Max Chiswick, Sam Ganzfried:
Prediction of Bayesian Intervals for Tropical Storms. FLAIRS 2020: 27-32 - [c24]Sam Ganzfried, Max Chiswick:
Most Important Fundamental Rule of Poker Strategy. FLAIRS 2020: 39-44 - [i18]Sam Ganzfried:
Fictitious Play Outperforms Counterfactual Regret Minimization. CoRR abs/2001.11165 (2020) - [i17]Sam Ganzfried:
Fast Complete Algorithm for Multiplayer Nash Equilibrium. CoRR abs/2002.04734 (2020) - [i16]Max Chiswick, Sam Ganzfried:
Prediction of Bayesian Intervals for Tropical Storms. CoRR abs/2003.05024 (2020) - [i15]Sam Ganzfried:
Algorithm for Computing Approximate Nash equilibrium in Continuous Games with Application to Continuous Blotto. CoRR abs/2006.07443 (2020) - [i14]Sam Ganzfried:
Computing Nash Equilibria in Multiplayer DAG-Structured Stochastic Games with Persistent Imperfect Information. CoRR abs/2010.13860 (2020)
2010 – 2019
- 2019
- [j7]Sam Ganzfried, Farzana Yusuf:
Optimal Number of Choices in Rating Contexts. Big Data Cogn. Comput. 3(3): 48 (2019) - [c23]Sheila Alemany, Jonathan Beltran, Adrián Pérez, Sam Ganzfried:
Predicting Hurricane Trajectories Using a Recurrent Neural Network. AAAI 2019: 468-475 - [c22]Sam Ganzfried:
Mistakes in games. DAI 2019: 10:1-10:6 - [i13]Sam Ganzfried, Max Chiswick:
Most Important Fundamental Rule of Poker Strategy. CoRR abs/1906.09895 (2019) - [i12]Sam Ganzfried, Conner Laughlin, Charles Morefield:
Parallel Algorithm for Approximating Nash Equilibrium in Multiplayer Stochastic Games with Application to Naval Strategic Planning. CoRR abs/1910.00193 (2019) - [i11]Sam Ganzfried:
Mistakes in Games. CoRR abs/1910.00225 (2019) - 2018
- [j6]Sam Ganzfried, Austin Nowak, Joannier Pinales:
Successful Nash Equilibrium Agent for a Three-Player Imperfect-Information Game. Games 9(2): 33 (2018) - [c21]Sam Ganzfried, Qingyun Sun:
Bayesian Opponent Exploitation in Imperfect-Information Games. AAAI Spring Symposia 2018 - [c20]Sam Ganzfried, Qingyun Sun:
Bayesian Opponent Exploitation in Imperfect-Information Games. CIG 2018: 1-8 - [i10]Sam Ganzfried, Farzana Yusuf:
Optimal Weighting for Exam Composition. CoRR abs/1801.06043 (2018) - [i9]Sheila Alemany, Jonathan Beltran, Adrián Pérez, Sam Ganzfried:
Predicting Hurricane Trajectories using a Recurrent Neural Network. CoRR abs/1802.02548 (2018) - [i8]Sam Ganzfried:
Algorithm for Evolutionarily Stable Strategies Against Pure Mutations. CoRR abs/1803.00607 (2018) - [i7]Sam Ganzfried, Austin Nowak, Joannier Pinales:
Successful Nash Equilibrium Agent for a 3-Player Imperfect-Information Game. CoRR abs/1804.04789 (2018) - 2017
- [j5]Sam Ganzfried:
Reflections on the First Man versus Machine No-Limit Texas Hold 'em Competition. AI Mag. 38(2): 77-85 (2017) - [j4]Sam Ganzfried, Farzana Yusuf:
Computing Human-Understandable Strategies: Deducing Fundamental Rules of Poker Strategy. Games 8(4): 49 (2017) - [c19]Sam Ganzfried, Farzana Yusuf:
Learning Human-Understandable Strategies. AAAI Workshops 2017 - [c18]Kailiang Hu, Sam Ganzfried:
Midgame Solving: A New Weapon for Efficient Large-Scale Equilibrium Approximation. ICTAI 2017: 404-408 - 2016
- [c17]Sam Ganzfried:
Optimal Number of Choices in Rating Contexts. IDM@NIPS 2016: 61-74 - [i6]Sam Ganzfried:
Bayesian Opponent Exploitation in Imperfect-Information Games. CoRR abs/1603.03491 (2016) - [i5]Sam Ganzfried:
Optimal Number of Choices in Rating Contexts. CoRR abs/1605.06588 (2016) - [i4]Sam Ganzfried, Farzana Yusuf:
Learning Human-Understandable Strategies. CoRR abs/1612.06340 (2016) - 2015
- [j3]Stefano V. Albrecht, André da Motta Salles Barreto, Darius Braziunas, David L. Buckeridge, Heriberto Cuayáhuitl, Nina Dethlefs, Markus Endres, Amir-massoud Farahmand, Mark Fox, Lutz Frommberger, Sam Ganzfried, Yolanda Gil, Sébastien Guillet, Lawrence E. Hunter, Arnav Jhala, Kristian Kersting, George Dimitri Konidaris, Freddy Lécué, Sheila A. McIlraith, Sriraam Natarajan, Zeinab Noorian, David Poole, Rémi Ronfard, Alessandro Saffiotti, Arash Shaban-Nejad, Biplav Srivastava, Gerald Tesauro, Rosario Uceda-Sosa, Guy Van den Broeck, Martijn van Otterlo, Byron C. Wallace, Paul Weng, Jenna Wiens, Jie Zhang:
Reports of the AAAI 2014 Conference Workshops. AI Mag. 36(1): 87-98 (2015) - [j2]Sam Ganzfried:
Reflections on the first man vs. machine no-limit Texas hold 'em competition. SIGecom Exch. 14(2): 2-15 (2015) - [j1]Sam Ganzfried, Tuomas Sandholm:
Safe Opponent Exploitation. ACM Trans. Economics and Comput. 3(2): 8:1-8:28 (2015) - [c16]Noam Brown, Sam Ganzfried, Tuomas Sandholm:
Tartanian7: A Champion Two-Player No-Limit Texas Hold'em Poker-Playing Program. AAAI 2015: 4270-4271 - [c15]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 - [c14]Sam Ganzfried, Tuomas Sandholm:
Endgame Solving in Large Imperfect-Information Games. AAAI Workshop: Computer Poker and Imperfect Information 2015 - [c13]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 - [c12]Sam Ganzfried, Tuomas Sandholm:
Endgame Solving in Large Imperfect-Information Games. AAMAS 2015: 37-45 - [e1]Sam Ganzfried:
Computer Poker and Imperfect Information, Papers from the 2015 AAAI Workshop, Austin, Texas, USA, January 26, 2015. AAAI Technical Report WS-15-07, AAAI Press 2015, ISBN 978-1-57735-718-6 [contents] - [i3]Stefano V. Albrecht, J. Christopher Beck, David L. Buckeridge, Adi Botea, Cornelia Caragea, Chi-Hung Chi, Theodoros Damoulas, Bistra Dilkina, Eric Eaton, Pooyan Fazli, Sam Ganzfried, Marius Lindauer, Marlos C. Machado, Yuri Malitsky, Gary Marcus, Sebastiaan A. Meijer, Francesca Rossi, Arash Shaban-Nejad, Sylvie Thiébaux, Manuela M. Veloso, Toby Walsh, Can Wang, Jie Zhang, Yu Zheng:
Reports from the 2015 AAAI Workshop Program. AI Mag. 36(2): 90-101 (2015) - [i2]Sam Ganzfried:
My Reflections on the First Man vs. Machine No-Limit Texas Hold 'em Competition. CoRR abs/1510.08578 (2015) - 2014
- [c11]Sam Ganzfried, Tuomas Sandholm:
Potential-Aware Imperfect-Recall Abstraction with Earth Mover's Distance in Imperfect-Information Games. AAAI 2014: 682-690 - 2013
- [c10]Sam Ganzfried, Tuomas Sandholm:
Action Translation in Extensive-Form Games with Large Action Spaces: Axioms, Paradoxes, and the Pseudo-Harmonic Mapping. IJCAI 2013: 120-128 - 2012
- [c9]Sam Ganzfried, Tuomas Sandholm, Kevin Waugh:
Strategy purification and thresholding: effective non-equilibrium approaches for playing large games. AAMAS 2012: 871-878 - [c8]Samuel Ganzfried, Tuomas Sandholm:
Safe opponent exploitation. EC 2012: 587-604 - 2011
- [c7]Sam Ganzfried, Tuomas Sandholm, Kevin Waugh:
Strategy Purification. Applied Adversarial Reasoning and Risk Modeling 2011 - [c6]Sam Ganzfried:
Computing Strong Game-Theoretic Strategies in Jotto. ACG 2011: 282-294 - [c5]Sam Ganzfried, Tuomas Sandholm:
Game theory-based opponent modeling in large imperfect-information games. AAMAS 2011: 533-540 - [c4]Sam Ganzfried, Tuomas Sandholm, Kevin Waugh:
Strategy purification. AAMAS 2011: 1111-1112 - [i1]Sam Ganzfried:
Oracular Form and Computing Strong Game-Theoretic Jotto Strategies. CoRR abs/1107.3342 (2011) - 2010
- [c3]Sam Ganzfried, Tuomas Sandholm:
Computing equilibria by incorporating qualitative models? AAMAS 2010: 183-190
2000 – 2009
- 2009
- [c2]Sam Ganzfried, Tuomas Sandholm:
Computing Equilibria in Multiplayer Stochastic Games of Imperfect Information. IJCAI 2009: 140-146 - 2008
- [c1]Sam Ganzfried, Tuomas Sandholm:
Computing an approximate jam/fold equilibrium for 3-player no-limit Texas Hold'em tournaments. AAMAS (2) 2008: 919-925
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
