default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrew Gilpin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2012
[j5]Andrew Gilpin, Javier Peña, Tuomas Sandholm:
First-order algorithm with 𝒪(ln(1/ε)) convergence for ε-equilibrium in two-person zero-sum games. Math. Program. 133(1-2): 279-298 (2012)- 2011
- [j4]Andrew Gilpin, Tuomas Sandholm:
Information-theoretic approaches to branching in search. Discret. Optim. 8(2): 147-159 (2011) - 2010
- [j3]Samid Hoda, Andrew Gilpin, Javier Peña, Tuomas Sandholm:
Smoothing Techniques for Computing Nash Equilibria of Sequential Games. Math. Oper. Res. 35(2): 494-512 (2010) - 2007
- [j2]Andrew Gilpin, Tuomas Sandholm:
Lossless abstraction of imperfect information games. J. ACM 54(5): 25 (2007) - 2005
- [j1]Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine:
CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions. Manag. Sci. 51(3): 374-390 (2005)
Conference and Workshop Papers
- 2010
- [c20]Andrew Gilpin, Tuomas Sandholm:
Speeding up gradient-based algorithms for sequential games. AAMAS 2010: 1463-1464 - 2008
- [c19]Andrew Gilpin, Javier Peña, Tuomas Sandholm:
First-Order Algorithm with O(ln(1/e)) Convergence for e-Equilibrium in Two-Person Zero-Sum Games. AAAI 2008: 75-82 - [c18]Andrew Gilpin, Tuomas Sandholm:
Expectation-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker. AAAI 2008: 1454-1457 - [c17]Andrew Gilpin, Tuomas Sandholm:
Solving two-person zero-sum repeated games of incomplete information. AAMAS (2) 2008: 903-910 - [c16]Andrew Gilpin, Tuomas Sandholm, Troels Bjerre Sørensen:
A heads-up no-limit Texas Hold'em poker player: discretized betting models and automatically generated equilibrium-finding programs. AAMAS (2) 2008: 911-918 - [c15]Andrew Gilpin, Tuomas Sandholm, Troels Bjerre Sørensen:
GS3 and Tartanian: game theory-based heads-up limit and no-limit Texas Hold'em poker-playing programs. AAMAS (Demos) 2008: 1647-1648 - 2007
- [c14]Andrew Gilpin, Tuomas Sandholm, Troels Bjerre Sørensen:
Potential-Aware Automated Abstraction of Sequential Games, and Holistic Equilibrium Analysis of Texas Hold'em Poker. AAAI 2007: 50-57 - [c13]Andrew Gilpin, Tuomas Sandholm:
Better automated abstraction techniques for imperfect information games, with application to Texas Hold'em poker. AAMAS 2007: 192 - [c12]Andrew Gilpin, Tuomas Sandholm:
Information-Theoretic Approaches to Branching in Search. IJCAI 2007: 2286-2292 - [c11]Andrew Gilpin, Samid Hoda, Javier Peña, Tuomas Sandholm:
Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games. WINE 2007: 57-69 - 2006
- [c10]Andrew Gilpin, Tuomas Sandholm:
A Competitive Texas Hold'em Poker Player via Automated Abstraction and Real-Time Equilibrium Computation. AAAI 2006: 1007-1013 - [c9]Andrew Gilpin, Tuomas Sandholm:
Information-theoretic approaches to branching in search. AAMAS 2006: 545-547 - [c8]Tuomas Sandholm, Andrew Gilpin:
Sequences of take-it-or-leave-it offers: near-optimal auctions without full valuation revelation. AAMAS 2006: 1127-1134 - [c7]Andrew Gilpin, Tuomas Sandholm:
A Texas Hold'em poker player based on automated abstraction and real-time equilibrium computation. AAMAS 2006: 1453-1454 - [c6]Andrew Gilpin, Tuomas Sandholm:
Finding equilibria in large sequential games of imperfect information. EC 2006: 160-169 - 2005
- [c5]Tuomas Sandholm, Andrew Gilpin, Vincent Conitzer:
Mixed-Integer Programming Methods for Finding Nash Equilibria. AAAI 2005: 495-501 - [c4]Andrew Gilpin, Tuomas Sandholm:
Optimal Rhode Island Hold'em Poker. AAAI 2005: 1684-1685 - 2003
- [c3]Tuomas Sandholm, Andrew Gilpin:
Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation. AMEC 2003: 73-91 - 2002
- [c2]Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine:
Winner determination in combinatorial auction generalizations. AAMAS 2002: 69-76 - 2001
- [c1]Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine:
CABOB: A Fast Optimal Algorithm for Combinatorial Auctions. IJCAI 2001: 1102-1108
Informal and Other Publications
- 2005
- [i1]Tuomas Sandholm, Andrew Gilpin:
Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation. Computing and Markets 2005
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 2024-04-24 23:01 CEST 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:
