Uri Nadav


Bid optimization for broad match ad auctions E. Even Dar, V. Mirrokni, S. Muthukrishnan, Y. Mansour. Proceedings of the 18th international conference on World wide web, 2009.

On the convergence of regret minimization dynamics in concave games with E. Even-Dar, Y. Mansour. Proceedings of the forty-first annual ACM symposium on Theory of computing, 2009

The limits of smoothness: A primal-dual framework for price of anarchy bounds with T. Roughgarden. Internet and Network Economics, 2010

Ad auctions with data with H. Fu, P. Jordan, M. Mahdian, I. Talgam-Cohen, S. Vassilvitskii. Algorithmic Game Theory, 2012.

No regret learning in oligopolies: Cournot vs. Bertrand with G. Piliouras. Algorithmic Game Theory, 2010.

Efficient contention resolution protocols for selfish agents with A Fiat, Y Mansour. SODA 7, 2007.

Fault-tolerant storage in a dynamic environment with M. Naor. Distributed Computing, 390-404 12 2004

Quasi-proportional mechanisms: Prior-free revenue maximization with V Mirrokni, S Muthukrishnan. LATIN 2010: Theoretical Informatics, 565-576 9 2010

Competitive queue management for latency sensitive packets with A Fiat, Y Mansour. Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete ... 8 2008

The dynamic and-or quorum system with M. Naor. Distributed Computing, 2005.

Lattice games and the economics of aggregators with P. Jordan, K. Punera, A. Skrzypacz, G Varghese. Proceedings of the 21st international conference on World Wide Web, 2012.

Uncoupled potentials for proportional allocation markets with R Johari, T Roughgarden. Decision and Control and European Control Conference (CDC-ECC), 2011.

MANAGING DISTRIBUTION PARAMETER UTILIZATION with P Hummel. US Patent 20,140,324,602. 2014.