Skip to content
conftrace_

game theory

895 papers

GT

Papers

Learning Optimal Commitment to Overcome Insecurity NeurIPS 2014 On the convergence of no-regret learning in selfish routing ICML 2014 Optimal Regret Minimization in Posted-Price Auctions with Strategic Buyers NeurIPS 2014 Sparse binary zero-sum games ACML 2014 Approachability, fast and slow COLT 2013 Bayesian Games for Adversarial Regression Problems ICML 2013 Convergence of Monte Carlo Tree Search in Simultaneous Move Games NeurIPS 2013 Minimax Optimal Algorithms for Unconstrained Linear Optimization NeurIPS 2013 Opportunistic Strategies for Generalized No-Regret Problems COLT 2013 Optimization, Learning, and Games with Predictable Sequences NeurIPS 2013 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 Learning Valuation Functions COLT 2012 No Internal Regret via Neighborhood Watch AISTATS 2012 Static Prediction Games for Adversarial Learning Problems JMLR 2012 Tractable Objectives for Robust Policy Optimization NeurIPS 2012 (weak) Calibration is Computationally Hard COLT 2012 A conditional game for comparing approximations AISTATS 2011 Discussion of “A conditional game for comparing approximations” AISTATS 2011 Does an Efficient Calibrated Forecasting Strategy Exist? COLT 2011 On Strategy Stitching in Large Extensive Form Multiplayer Games NeurIPS 2011 Robust approachability and regret minimization in games with partial monitoring COLT 2011 Bayesian Action-Graph Games NeurIPS 2010 Inference and communication in the game of Password NeurIPS 2010 Repeated Games against Budgeted Adversaries NeurIPS 2010