All Publications
- Martin ZinkevichRules of Machine Learning. Invited talk at Reliable Machine Learning in the Wild.
- M. Zinkevich, M. Bowling, M. Wunder. The Lemonade Stand Game Competition: Solving Unsolvable Games. SIGEcom Exchanges. Vol. 10. No. 1. January 2011. (Invited)
- S. Zilles, S. Lange, R. Holte, M. Zinkevich.Models of Cooperative Teaching and Learning. JMLR 2011. An earlier version appeared in COLT 2008.
- M. Johanson, K. Waugh, M. Bowling, M. Zinkevich. Accelerating Best Response Calculation in Large Extensive Games. IJCAI 2011.
- W. Chu, M. Zinkevich, L. Li, A. Thomas, B Tseng. Unbiased Online Active Learning in Data Streams. KDD 2011.
- S. Pandey. M. Aly. A. Bagherjeiran. A. Hatch. P. Ciccolo. A. Ratnaparkhi. M. Zinkevich. Learning to Target: What Works for Behavioral Targeting. CIKM 2011.
- M. Zinkevich, M. Weimer, A. Smola, L. Li.Parallelized Stochastic Gradient Descent. NIPS 2010.
- M. Zinkevich, A. Smola and J. Langford.Slow Learners are Fast. NIPS 2009.
- M. Lanctot, K. Waugh, M. Zinkevich, M. Bowling.Monte Carlo Sampling for Regret Minimization in Extensive Games. NIPS 2009.
- B. Rubinstein, A. Ghosh, S. Vassilvitski, M. Zinkevich. Adaptive Bidding for Display Advertising. WWW 2009.
- J. Attenberg, K. Weinberger, A. Dasgupta, A. Smola, M. Zinkevich. Collaborative Email-Spam Filtering with the Hashing Trick. CEAS 2009. Another version appeared in Virus Bulletin, November 2009.
- M. Zinkevich, M. Bowling, M. Johanson, C. Piccione.Regret Minimization in Games with Incomplete Information. NIPS 2007.
- M. Johanson, M. Zinkevich, and M. Bowling. Computing robust
counter-strategies. NIPS 2007.
- M. Zinkevich, M. Bowling, N. Burch.A New Algorithm for Generating Equilibria in Massive Zero-Sum Games. AAAI 2007.
- N. Ratliff, D. Bagnell, M. Zinkevich. Subgradient Methods for Structured Prediction. Eleventh International Conference on Artificial Intelligence and Statistics (AISTATS-07), 2007.
- M. Zinkevich, A. Greenwald, M. Littman. A Hierarchy of Prescriptive Goals for Multiagent Learning. In Artificial Intelligence, Vol. 171:7, May 2007.
- M. Littman, M. Zinkevich. The 2006 AAAI Computer Poker Competition. Note in JCGA, Vol. 29:3. 2006. (Invited)
- A. Blum, T. Sandholm, and M. Zinkevich. Online algorithms for market clearing. In Journal of the ACM, Vol. 53, No. 5, Sept. 2006. A previous version appeared in Symposium on Discrete Algorithms, 2002.
- M. Littman, N. Ravi, A. Talwar, M. Zinkevich. An Efficient Optimal-Equilibrium Algorithm for Two-Player Game Trees. Twenty-Second Conference on Uncertainty in Artificial Intelligence (UAI-06), 2006.
- M. Zinkevich, M. Bowling, N. Bard, M. Kan, and D. Billings. Optimal Unbiased Estimators for Evaluating Agent
Performance.
Twenty-First National Conference on Artificial Intelligence (AAAI-06),
2006.
- A. Rettinger, M. Zinkevich, and M. Bowling.
Boosting Expert Ensembles for Rapid Concept Recall.
Twenty-First National Conference on Artificial Intelligence (AAAI-06),
2006.
-
N. Sturtevant, M. Zinkevich, and M. Bowling.
ProbMaxn: Opponent Modeling in N-Player Games.
Twenty-First National Conference on Artificial Intelligence (AAAI-06),
2006.
- N. Ratliff, J. Bagnell, M. Zinkevich. Maximum Margin Planning.
Twenty-Third International Conference on Machine Learning, 2006. A previous version
appeared in
Neural Information Processing Systems, Workshop on Machine Learning
Based Robotics in Unstructured Environments.
- M. Zinkevich, A. Greenwald, and M. Littman.
Cyclic equilibria in markov games.
In Neural Information Processing Systems, 2005.
-
M. Zinkevich.
Theoretical guarantees for algorithms in multiagent
settings.
PhD thesis, Carnegie Mellon University, 2004
- A. Blum, J. Jackson, T. Sandholm, and M. Zinkevich. Preference elicitation and query learning. Journal of Machine Learning Research 2004. A previous version appeared in Sixteenth Annual Conference on Computational Learning Theory, 2003.
- M. Zinkevich, A. Blum, and T. Sandholm.On polynomialtime preference elicitation with value queries. In ACM Conference on Electronic Commerce, 2003.
- M. Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In Twentieth International Conference on Machine Learning, 2003.
- J. Langford, M. Zinkevich, and S. Kakade. Competitive analysis of the explore/exploit tradeoff. In Nineteenth International Conference on Machine Learning, 2002.
- T. Balch and M. Zinkevich. Symmetry in markov decision processes and its implications for single agent and multiagent learning. In Eighteenth International Conference on Machine Learning, 2001.
Working Papers