Geoffrey J. Gordon (Selection)

Machine Learning Department, Carnegie Mellon University

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide -

50 H. Brendan McMahan, Geoffrey J. Gordon: A Unification of Extensive-Form Games and Markov Decision Processes. AAAI 2007: 86-93

45 H. Brendan McMahan, Geoffrey J. Gordon: A Fast Bundle-based Anytime Algorithm for Poker and other Convex Games. Journal of Machine Learning Research - Proceedings Track 2: 323-330 (2007)

33 H. Brendan McMahan, Geoffrey J. Gordon: Fast Exact Planning in Markov Decision Processes. ICAPS 2005: 151-160

31 H. Brendan McMahan, Maxim Likhachev, Geoffrey J. Gordon: Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees. ICML 2005: 569-576

21 H. Brendan McMahan, Geoffrey J. Gordon, Avrim Blum: Planning in the Presence of Cost Functions Controlled by an Adversary. ICML 2003: 536-543

Selection of 5 from 91 records - Geoffrey J. Gordon has 103 coauthors

Last update 2012-09-10 CET by the DBLP Team —

Content released under the ODC-BY 1.0 license — See also our legal information page

50		H. Brendan McMahan, Geoffrey J. Gordon: A Unification of Extensive-Form Games and Markov Decision Processes. AAAI 2007: 86-93
45		H. Brendan McMahan, Geoffrey J. Gordon: A Fast Bundle-based Anytime Algorithm for Poker and other Convex Games. Journal of Machine Learning Research - Proceedings Track 2: 323-330 (2007)
33		H. Brendan McMahan, Geoffrey J. Gordon: Fast Exact Planning in Markov Decision Processes. ICAPS 2005: 151-160
31		H. Brendan McMahan, Maxim Likhachev, Geoffrey J. Gordon: Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees. ICML 2005: 569-576
21		H. Brendan McMahan, Geoffrey J. Gordon, Avrim Blum: Planning in the Presence of Cost Functions Controlled by an Adversary. ICML 2003: 536-543