 | 2009 |
| 22 |  | Michael H. Bowling,
Nicholas Abou Risk,
Nolan Bard,
Darse Billings,
Neil Burch,
Joshua Davidson,
John Hawkin,
Robert Holte,
Michael Johanson,
Morgan Kan,
Bryce Paradis,
Jonathan Schaeffer,
David Schnizlein,
Duane Szafron,
Kevin Waugh,
Martin Zinkevich:
A demonstration of the Polaris poker system.
AAMAS (2) 2009: 1391-1392 |
| 21 |  | Arpita Ghosh,
Benjamin I. P. Rubinstein,
Sergei Vassilvitskii,
Martin Zinkevich:
Adaptive bidding for display advertising.
WWW 2009: 251-260 |
| 2008 |
| 20 |  | Sandra Zilles,
Steffen Lange,
Robert Holte,
Martin Zinkevich:
Teaching Dimensions based on Cooperative Learning.
COLT 2008: 135-146 |
| 2007 |
| 19 |  | Martin Zinkevich,
Michael H. Bowling,
Neil Burch:
A New Algorithm for Generating Equilibria in Massive Zero-Sum Games.
AAAI 2007: 788- |
| 18 |  | Michael Johanson,
Martin Zinkevich,
Michael H. Bowling:
Computing Robust Counter-Strategies.
NIPS 2007 |
| 17 |  | Martin Zinkevich,
Michael Johanson,
Michael H. Bowling,
Carmelo Piccione:
Regret Minimization in Games with Incomplete Information.
NIPS 2007 |
| 16 |  | Martin Zinkevich,
Amy R. Greenwald,
Michael L. Littman:
A hierarchy of prescriptive goals for multiagent learning.
Artif. Intell. 171(7): 440-447 (2007) |
| 2006 |
| 15 |  | Achim Rettinger,
Martin Zinkevich,
Michael H. Bowling:
Boosting Expert Ensembles for Rapid Concept Recall.
AAAI 2006 |
| 14 |  | Martin Zinkevich,
Michael H. Bowling,
Nolan Bard,
Morgan Kan,
Darse Billings:
Optimal Unbiased Estimators for Evaluating Agent Performance.
AAAI 2006 |
| 13 |  | Nathan R. Sturtevant,
Martin Zinkevich,
Michael H. Bowling:
Prob-Maxn: Playing N-Player Games with Opponent Models.
AAAI 2006 |
| 12 |  | Nathan D. Ratliff,
J. Andrew Bagnell,
Martin Zinkevich:
Maximum margin planning.
ICML 2006: 729-736 |
| 11 |  | Alborz Geramifard,
Michael H. Bowling,
Martin Zinkevich,
Richard S. Sutton:
iLSTD: Eligibility Traces and Convergence Analysis.
NIPS 2006: 441-448 |
| 10 |  | Michael L. Littman,
Nishkam Ravi,
Arjun Talwar,
Martin Zinkevich:
An Efficient Optimal-Equilibrium Algorithm for Two-player Game Trees.
UAI 2006 |
| 9 |  | Avrim Blum,
Tuomas Sandholm,
Martin Zinkevich:
Online algorithms for market clearing.
J. ACM 53(5): 845-879 (2006) |
| 2005 |
| 8 |  | Martin Zinkevich,
Amy R. Greenwald,
Michael L. Littman:
Cyclic Equilibria in Markov Games.
NIPS 2005 |
| 2004 |
| 7 |  | Avrim Blum,
Jeffrey C. Jackson,
Tuomas Sandholm,
Martin Zinkevich:
Preference Elicitation and Query Learning.
Journal of Machine Learning Research 5: 649-667 (2004) |
| 2003 |
| 6 |  | Martin Zinkevich,
Avrim Blum,
Tuomas Sandholm:
On polynomial-time preference elicitation with value queries.
ACM Conference on Electronic Commerce 2003: 176-185 |
| 5 |  | Avrim Blum,
Jeffrey C. Jackson,
Tuomas Sandholm,
Martin Zinkevich:
Preference Elicitation and Query Learning.
COLT 2003: 13-25 |
| 4 |  | Martin Zinkevich:
Online Convex Programming and Generalized Infinitesimal Gradient Ascent.
ICML 2003: 928-936 |
| 2002 |
| 3 |  | John Langford,
Martin Zinkevich,
Sham Kakade:
Competitive Analysis of the Explore/Exploit Tradeoff.
ICML 2002: 339-346 |
| 2 |  | Avrim Blum,
Tuomas Sandholm,
Martin Zinkevich:
Online algorithms for market clearing.
SODA 2002: 971-980 |
| 2001 |
| 1 |  | Martin Zinkevich,
Tucker R. Balch:
Symmetry in Markov Decision Processes and its Implications for Single Agent and Multiagent Learning.
ICML 2001: 632- |