dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Andrew Gilpin Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew Gilpin, Javier Peña, Tuomas Sandholm: First-order algorithm with $${\mathcal{O}({\rm ln}(1{/}\epsilon))}$$ convergence for $${\epsilon}$$ -equilibrium in two-person zero-sum games. Math. Program. 133(1-2): 279-298 (2012)
2011
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew Gilpin, Tuomas Sandholm: Information-theoretic approaches to branching in search. Discrete Optimization 8(2): 147-159 (2011)
2010
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew Gilpin, Tuomas Sandholm: Speeding up gradient-based algorithms for sequential games. AAMAS 2010: 1463-1464
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSamid 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)
2008
22no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew Gilpin, Tuomas Sandholm: Expectation-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker. AAAI 2008: 1454-1457
21no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew 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
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew Gilpin, Tuomas Sandholm: Solving two-person zero-sum repeated games of incomplete information. AAMAS (2) 2008: 903-910
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew 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
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew 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
17no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew 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
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew Gilpin, Tuomas Sandholm: Better automated abstraction techniques for imperfect information games, with application to Texas Hold'em poker. AAMAS 2007: 192
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew Gilpin, Tuomas Sandholm: Information-Theoretic Approaches to Branching in Search. IJCAI 2007: 2286-2292
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew Gilpin, Samid Hoda, Javier Peña, Tuomas Sandholm: Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games. WINE 2007: 57-69
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew Gilpin, Tuomas Sandholm: Lossless abstraction of imperfect information games. J. ACM 54(5): (2007)
2006
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew Gilpin, Tuomas Sandholm: A Competitive Texas Hold'em Poker Player via Automated Abstraction and Real-Time Equilibrium Computation. AAAI 2006: 1007-1013
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTuomas Sandholm, Andrew Gilpin: Sequences of take-it-or-leave-it offers: near-optimal auctions without full valuation revelation. AAMAS 2006: 1127-1134
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew Gilpin, Tuomas Sandholm: A Texas Hold'em poker player based on automated abstraction and real-time equilibrium computation. AAMAS 2006: 1453-1454
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew Gilpin, Tuomas Sandholm: Information-theoretic approaches to branching in search. AAMAS 2006: 545-547
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew Gilpin, Tuomas Sandholm: Finding equilibria in large sequential games of imperfect information. ACM Conference on Electronic Commerce 2006: 160-169
2005
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew Gilpin, Tuomas Sandholm: Optimal Rhode Island Hold'em Poker. AAAI 2005: 1684-1685
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTuomas Sandholm, Andrew Gilpin, Vincent Conitzer: Mixed-Integer Programming Methods for Finding Nash Equilibria. AAAI 2005: 495-501
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTuomas Sandholm, Andrew Gilpin: Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation. Computing and Markets 2005
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine: CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions. Management Science 51(3): 374-390 (2005)
2003
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTuomas Sandholm, Andrew Gilpin: Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation. AMEC 2003: 73-91
2002
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine: Winner determination in combinatorial auction generalizations. AAMAS 2002: 69-76
2001
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine: CABOB: A Fast Optimal Algorithm for Combinatorial Auctions. IJCAI 2001: 1102-1108

Coauthor Index

1Vincent Conitzer [6]
2Samid Hoda [14] [23]
3David Levine [1] [2] [4]
4Javier Peña [14] [21] [23] [26]
5Tuomas Sandholm [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [26]
6Troels Bjerre Sørensen [17] [18] [19]
7Subhash Suri [1] [2] [4]

Last update Thu May 31 18:55:10 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page