conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Game Theory

944 papers

Papers per year

1
3
9
98
99
'05
'10
'15
'20
'25

Papers

Minimax Optimal Algorithms for Unconstrained Linear Optimization NIPS 2013
Optimization, Learning, and Games with Predictable Sequences NIPS 2013
Aggregating Optimistic Planning Trees for Solving Markov Decision Processes NIPS 2013
How to Hedge an Option Against an Adversary: Black-Scholes Pricing is Minimax Optimal NIPS 2013
Open Problem: Lower bounds for Boosting with Hadamard Matrices COLT 2013
Opportunistic Strategies for Generalized No-Regret Problems COLT 2013
Approachability, fast and slow COLT 2013
A near-optimal algorithm for finite partial-monitoring games against adversarial opponents COLT 2013
Bayesian Games for Adversarial Regression Problems ICML 2013
Rational inference of relative preferences NIPS 2012
Efficient Monte Carlo Counterfactual Regret Minimization in Games with Many Player Actions NIPS 2012
Interpreting prediction markets: a stochastic approach NIPS 2012
Relax and Randomize : From Value to Algorithms NIPS 2012
Approximating Equilibria in Sequential Auctions with Incomplete Information and Multi-Unit Demand NIPS 2012
Random Utility Theory for Social Choice NIPS 2012
(weak) Calibration is Computationally Hard COLT 2012
Learning Valuation Functions COLT 2012
A Characterization of Scoring Rules for Linear Properties COLT 2012
Efficient Offline Communication Policies for Factored Multiagent POMDPs NIPS 2011
A conditional game for comparing approximations AISTATS 2011
Optimal and Robust Price Experimentation: Learning by Lottery AISTATS 2011
Minimax Policies for Combinatorial Prediction Games COLT 2011
Minimax Regret of Finite Partial-Monitoring Games in Stochastic Environments COLT 2011
Robust approachability and regret minimization in games with partial monitoring COLT 2011
Online Learning: Beyond Regret COLT 2011