| Computing optimal strategies to commit to in stochastic games J Letchford, L MacDermed, V Conitzer, R Parr, C Isbell Proceedings of the AAAI Conference on Artificial Intelligence 26 (1), 1380-1386, 2012 | 53 | 2012 |
| Point based value iteration with optimal belief compression for Dec-POMDPs LC MacDermed, CL Isbell Advances in neural information processing systems 26, 2013 | 37 | 2013 |
| Solving stochastic games L Dermed, C Isbell Advances in Neural Information Processing Systems 22, 2009 | 33 | 2009 |
| Markov games of incomplete information for multi-agent reinforcement learning L MacDermed, C Isbell, L Weiss Workshops at the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011 | 23 | 2011 |
| Quick polytope approximation of all correlated equilibria in stochastic games L MacDermed, K Narayan, C Isbell, L Weiss Proceedings of the AAAI Conference on Artificial Intelligence 25 (1), 707-712, 2011 | 16 | 2011 |
| Computing stackelberg strategies in stochastic games J Letchford, L MacDermed, V Conitzer, R Parr, CL Isbell ACM SIGecom Exchanges 11 (2), 36-40, 2012 | 5 | 2012 |
| Scaling up game theory: Achievable set methods for efficiently solving stochastic games of complete and incomplete information L MacDermed Sixteenth AAAI/SIGART Doctoral Consortium, 2011 | 2 | 2011 |
Vincent ConitzerProfessor of CS, Carnegie Mellon University; Professor of CS and Philosophy, University of OxfordVerified email at cs.cmu.edu
