Game Theory

Convergence of Monte Carlo Tree Search in Simultaneous Move Games NeurIPS 2013 Generalized Random Utility Models with Multiple Types NeurIPS 2013 How to Hedge an Option Against an Adversary: Black-Scholes Pricing is Minimax Optimal NeurIPS 2013 Learning Prices for Repeated Auctions with Strategic Buyers NeurIPS 2013 Minimax Optimal Algorithms for Unconstrained Linear Optimization NeurIPS 2013 Online Learning in Markov Decision Processes with Adversarially Chosen Transition Probability Distributions NeurIPS 2013 Open Problem: Lower bounds for Boosting with Hadamard Matrices COLT 2013 Opportunistic Strategies for Generalized No-Regret Problems COLT 2013 Optimization, Learning, and Games with Predictable Sequences NeurIPS 2013 A Characterization of Scoring Rules for Linear Properties COLT 2012 Approximating Equilibria in Sequential Auctions with Incomplete Information and Multi-Unit Demand NeurIPS 2012 Efficient Monte Carlo Counterfactual Regret Minimization in Games with Many Player Actions NeurIPS 2012 Interpreting prediction markets: a stochastic approach NeurIPS 2012 Learning Valuation Functions COLT 2012 Random Utility Theory for Social Choice NeurIPS 2012 Rational inference of relative preferences NeurIPS 2012 Relax and Randomize : From Value to Algorithms NeurIPS 2012 (weak) Calibration is Computationally Hard COLT 2012 A conditional game for comparing approximations AISTATS 2011 Does an Efficient Calibrated Forecasting Strategy Exist? COLT 2011 Efficient Offline Communication Policies for Factored Multiagent POMDPs NeurIPS 2011 Minimax Policies for Combinatorial Prediction Games COLT 2011 Minimax Regret of Finite Partial-Monitoring Games in Stochastic Environments COLT 2011 Online Learning: Beyond Regret COLT 2011 Optimal and Robust Price Experimentation: Learning by Lottery AISTATS 2011