Eyal Even-Dar

According to our database1, Eyal Even-Dar authored at least 36 papers between 2001 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2016
Reinforcement Learning.
Encyclopedia of Algorithms, 2016

2011
Modeling the Parallel Execution of Black-Box Services.
Proceedings of the 3rd USENIX Workshop on Hot Topics in Cloud Computing, 2011

2010
Approximation Schemes for Sequential Posted Pricing in Multi-unit Auctions.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Selective Call Out and Real Time Bidding.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Learning with Global Cost in Stochastic Environments.
Proceedings of the COLT 2010, 2010

Regret Minimization With Concept Drift.
Proceedings of the COLT 2010, 2010

2009
Online Markov Decision Processes.
Math. Oper. Res., 2009

Bid optimization for broad match ad auctions.
Proceedings of the 18th International Conference on World Wide Web, 2009

On the convergence of regret minimization dynamics in concave games.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Tutorial summary: Convergence of natural dynamics to equilibria.
Proceedings of the 26th Annual International Conference on Machine Learning, 2009

Online Learning for Global Cost Functions.
Proceedings of the COLT 2009, 2009

2008
Reinforcement Learning.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Theory research at Google.
SIGACT News, 2008

Position Auctions with Bidder-Specific Minimum Prices.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

2007
Convergence time to Nash equilibrium in load balancing.
ACM Trans. Algorithms, 2007

A Note on Maximizing the Spread of Influence in Social Networks.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Sponsored Search with Contexts.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

A network formation game for bipartite exchange economies.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

The Value of Observation for Monitoring Dynamic Systems.
Proceedings of the IJCAI 2007, 2007

Regret to the Best vs. Regret to the Average.
Proceedings of the Learning Theory, 20th Annual Conference on Learning Theory, 2007

2006
Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems.
J. Mach. Learn. Res., 2006

On nash equilibria for a network creation game.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

(In)Stability properties of limit order dynamics.
Proceedings of the Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), 2006

Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing games.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

A Small World Threshold for Economic Network Formation.
Proceedings of the Advances in Neural Information Processing Systems 19, 2006

Risk-Sensitive Online Learning.
Proceedings of the Algorithmic Learning Theory, 17th International Conference, 2006

2005
Planning in POMDPs Using Multiplicity Automata.
Proceedings of the UAI '05, 2005

Fast convergence of selfish rerouting.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Reinforcement Learning in POMDPs Without Resets.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

2004
Experts in a Markov Decision Process.
Proceedings of the Advances in Neural Information Processing Systems 17 [Neural Information Processing Systems, 2004

2003
Action Elimination and Stopping Conditions for Reinforcement Learning.
Proceedings of the Machine Learning, 2003

Convergence Time to Nash Equilibria.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Approximate Equivalence of Markov Decision Processes.
Proceedings of the Computational Learning Theory and Kernel Machines, 2003

2002
PAC Bounds for Multi-armed Bandit and Markov Decision Processes.
Proceedings of the Computational Learning Theory, 2002

2001
Convergence of Optimistic and Incremental Q-Learning.
Proceedings of the Advances in Neural Information Processing Systems 14 [Neural Information Processing Systems: Natural and Synthetic, 2001

Learning Rates for Q-Learning.
Proceedings of the Computational Learning Theory, 2001


  Loading...