Travelled to:1 × Canada
1 × Italy
2 × USA
Collaborated with:T.Sandholm L.Xia N.Garera
Talks about:learn (4) algorithm (2) onlin (2) bound (2) game (2) stationari (1) framework (1) learnabl (1) communic (1) approxim (1)
Person: Vincent Conitzer
DBLP: Conitzer:Vincent
Contributed to:
2012
200620042003Wrote 5 papers:
- KR-2012-ConitzerX #approach #approximate #multi
- Paradoxes of Multiple Elections: An Approximation Approach (VC, LX).
- ICML-2006-ConitzerG #algorithm #learning #online #problem
- Learning algorithms for online principal-agent problems (and selling goods online) (VC, NG), pp. 209–216.
- ICML-2004-ConitzerS #bound #communication #complexity #game studies #learning
- Communication complexity as a lower bound for learning in games (VC, TS).
- ICML-2003-ConitzerS #algorithm #learning #multi #named #self
- AWESOME: A General Multiagent Learning Algorithm that Converges in Self-Play and Learns a Best Response Against Stationary Opponents (VC, TS), pp. 83–90.
- ICML-2003-ConitzerS03a #bound #framework #game studies #named
- BL-WoLF: A Framework For Loss-Bounded Learnability In Zero-Sum Games (VC, TS), pp. 91–98.