Uri Nadav

According to our database, Uri Nadav authored at least 15 papers between 2004 and 2020.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2020

Hitting the High Notes: Subset Selection for Maximizing Expected Order Statistics.

Aranyak Mehta, Uri Nadav, Alexandros Psomas, Aviad Rubinstein

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019

Bid-Limited Targeting.

Patrick Hummel, Uri Nadav

ACM Trans. Economics and Comput., 2019

2012

Lattice games and the economics of aggregators.

Patrick R. Jordan, Uri Nadav, Kunal Punera, Andrzej Skrzypacz, George Varghese

Proceedings of the 21st World Wide Web Conference 2012, 2012

Ad Auctions with Data.

Hu Fu, Patrick R. Jordan, Mohammad Mahdian, Uri Nadav, Inbal Talgam-Cohen, Sergei Vassilvitskii

Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012

2011

Uncoupled potentials for proportional allocation markets.

Uri Nadav, Ramesh Johari, Tim Roughgarden

Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference, 2011

2010

The Limits of Smoothness: A Primal-Dual Framework for Price of Anarchy Bounds.

Uri Nadav, Tim Roughgarden

Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

No Regret Learning in Oligopolies: Cournot vs. Bertrand.

Uri Nadav, Georgios Piliouras

Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

Quasi-Proportional Mechanisms: Prior-Free Revenue Maximization.

Vahab S. Mirrokni, S. Muthukrishnan, Uri Nadav

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009

Protocols for selfish agents

Uri Nadav

PhD thesis, 2009

Bid optimization for broad match ad auctions.

Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan, Yishay Mansour, Uri Nadav

Proceedings of the 18th International Conference on World Wide Web, 2009

On the convergence of regret minimization dynamics in concave games.

Eyal Even-Dar, Yishay Mansour, Uri Nadav

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008

Competitive queue management for latency sensitive packets.

Amos Fiat, Yishay Mansour, Uri Nadav

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007

Efficient contention resolution protocols for selfish agents.

Amos Fiat, Yishay Mansour, Uri Nadav

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2005

The Dynamic And-Or Quorum System.

Uri Nadav, Moni Naor

Proceedings of the Distributed Computing, 19th International Conference, 2005

2004

Fault-Tolerant Storage in a Dynamic Environment.

Uri Nadav, Moni Naor

Proceedings of the Distributed Computing, 18th International Conference, 2004