| On the convergence of regret minimization dynamics in concave games E Even-Dar, Y Mansour, U Nadav Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 119 | 2009 |
| Bid optimization for broad match ad auctions E Even Dar, VS Mirrokni, S Muthukrishnan, Y Mansour, U Nadav Proceedings of the 18th international conference on World wide web, 231-240, 2009 | 66 | 2009 |
| Ad auctions with data H Fu, P Jordan, M Mahdian, U Nadav, I Talgam-Cohen, S Vassilvitskii International Symposium on Algorithmic Game Theory, 168-179, 2012 | 52 | 2012 |
| The limits of smoothness: A primal-dual framework for price of anarchy bounds U Nadav, T Roughgarden International Workshop on Internet and Network Economics, 319-326, 2010 | 43 | 2010 |
| No regret learning in oligopolies: Cournot vs. Bertrand U Nadav, G Piliouras International Symposium on Algorithmic Game Theory, 300-311, 2010 | 39 | 2010 |
| Advertisement Slot Allocation S Muthukrishnan, SVM Banadaki, U Nadav US Patent App. 12/363,585, 2010 | 31 | 2010 |
| Efficient contention resolution protocols for selfish agents A Fiat, Y Mansour, U Nadav SODA 7, 179-188, 2007 | 28 | 2007 |
| Quasi-proportional mechanisms: Prior-free revenue maximization V Mirrokni, S Muthukrishnan, U Nadav Latin American Symposium on Theoretical Informatics, 565-576, 2010 | 23 | 2010 |
| Competitive queue management for latency sensitive packets A Fiat, Y Mansour, U Nadav Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008 | 19 | 2008 |
| Hitting the high notes: Subset selection for maximizing expected order statistics A Mehta, U Nadav, A Psomas, A Rubinstein Advances in Neural Information Processing Systems 33, 15800-15810, 2020 | 15 | 2020 |
| Methods incorporating pacing constriants for bidding online advertisement display and apparatus conducting the same S Vassilvitskii, PR Jordan, M Mahdian, C Leggetter, P Krishnamurthy, ... US Patent App. 13/539,271, 2014 | 15 | 2014 |
| Fault-tolerant storage in a dynamic environment U Nadav, M Naor International Symposium on Distributed Computing, 390-404, 2004 | 15 | 2004 |
| Increasing Advertiser Utility in Broad Match Auctions E Even-Dar, SVM Banadaki, S Muthukrishnan, U Nadav US Patent App. 13/012,300, 2011 | 8 | 2011 |
| The dynamic and-or quorum system U Nadav, M Naor International Symposium on Distributed Computing, 472-486, 2005 | 8 | 2005 |
| Lattice games and the economics of aggregators PR Jordan, U Nadav, K Punera, A Skrzypacz, G Varghese Proceedings of the 21st international conference on World Wide Web, 549-558, 2012 | 6 | 2012 |
| Managing distribution parameter utilization P Hummel, U Nadav US Patent App. 14/082,966, 2014 | 5 | 2014 |
| Optimized machine learning system P Hummel, U Nadav US Patent App. 15/352,318, 2018 | 3 | 2018 |
| Method of Second Price Auction with Monopoly Reserve Price and Apparatus Conducting the Same S Vassilvitskii, PR Jordan, U Nadav, M Mahdian, I Talgam-Cohen, H Fu US Patent App. 13/629,968, 2014 | 2 | 2014 |
| Bid-limited targeting P Hummel, U Nadav ACM Transactions on Economics and Computation (TEAC) 7 (2), 1-33, 2019 | 1 | 2019 |
| Uncoupled potentials for proportional allocation markets U Nadav, R Johari, T Roughgarden 2011 50th IEEE Conference on Decision and Control and European Control …, 2011 | 1 | 2011 |
Eyal Even-DarFinalE-mail confirmado em final.co.il
