According to our database1, Uri Nadav authored at least 13 papers between 2004 and 2019.
Legend:Book In proceedings Article PhD thesis Other
ACM Trans. Economics and Comput., 2019
Lattice games and the economics of aggregators.
Proceedings of the 21st World Wide Web Conference 2012, 2012
Ad Auctions with Data.
Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012
Uncoupled potentials for proportional allocation markets.
Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference, 2011
The Limits of Smoothness: A Primal-Dual Framework for Price of Anarchy Bounds.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010
No Regret Learning in Oligopolies: Cournot vs. Bertrand.
Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010
Quasi-Proportional Mechanisms: Prior-Free Revenue Maximization.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010
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
Competitive queue management for latency sensitive packets.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008
Efficient contention resolution protocols for selfish agents.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007
The Dynamic And-Or Quorum System.
Proceedings of the Distributed Computing, 19th International Conference, 2005
Fault-Tolerant Storage in a Dynamic Environment.
Proceedings of the Distributed Computing, 18th International Conference, 2004