default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUri Nadav
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c15]Aranyak Mehta, Uri Nadav, Alexandros Psomas, Aviad Rubinstein:
Hitting the High Notes: Subset Selection for Maximizing Expected Order Statistics. NeurIPS 2020- [i3]Aranyak Mehta, Uri Nadav, Alexandros Psomas, Aviad Rubinstein:
Hitting the High Notes: Subset Selection for Maximizing Expected Order Statistics. CoRR abs/2012.07935 (2020)
2010 – 2019
- 2019
- [j1]Patrick Hummel, Uri Nadav:
Bid-Limited Targeting. ACM Trans. Economics and Comput. 7(2): 5:1-5:33 (2019) - 2018
- [c14]Patrick Hummel, Uri Nadav:
Bid-Limited Targeting. WWW 2018: 1329-1338 - 2012
- [c13]Hu Fu, Patrick R. Jordan, Mohammad Mahdian, Uri Nadav, Inbal Talgam-Cohen, Sergei Vassilvitskii:
Ad auctions with data. INFOCOM Workshops 2012: 184-189 - [c12]Hu Fu, Patrick R. Jordan, Mohammad Mahdian, Uri Nadav, Inbal Talgam-Cohen, Sergei Vassilvitskii:
Ad Auctions with Data. SAGT 2012: 168-179 - [c11]Patrick R. Jordan, Uri Nadav, Kunal Punera, Andrzej Skrzypacz, George Varghese:
Lattice games and the economics of aggregators. WWW 2012: 549-558 - 2011
- [c10]Uri Nadav, Ramesh Johari, Tim Roughgarden:
Uncoupled potentials for proportional allocation markets. CDC/ECC 2011: 4479-4484 - 2010
- [c9]Vahab S. Mirrokni, S. Muthukrishnan, Uri Nadav:
Quasi-Proportional Mechanisms: Prior-Free Revenue Maximization. LATIN 2010: 565-576 - [c8]Uri Nadav, Georgios Piliouras:
No Regret Learning in Oligopolies: Cournot vs. Bertrand. SAGT 2010: 300-311 - [c7]Uri Nadav, Tim Roughgarden:
The Limits of Smoothness: A Primal-Dual Framework for Price of Anarchy Bounds. WINE 2010: 319-326
2000 – 2009
- 2009
- [b1]Uri Nadav:
Protocols for selfish agents. Tel Aviv University, Israel, 2009 - [c6]Eyal Even-Dar, Yishay Mansour, Uri Nadav:
On the convergence of regret minimization dynamics in concave games. STOC 2009: 523-532 - [c5]Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan, Yishay Mansour, Uri Nadav:
Bid optimization for broad match ad auctions. WWW 2009: 231-240 - [i2]Eyal Even-Dar, Yishay Mansour, Vahab S. Mirrokni, S. Muthukrishnan, Uri Nadav:
Bid Optimization in Broad-Match Ad Auctions. CoRR abs/0901.3754 (2009) - [i1]Vahab S. Mirrokni, S. Muthukrishnan, Uri Nadav:
Quasi-Proportional Mechanisms: Prior-free Revenue Maximization. CoRR abs/0909.5365 (2009) - 2008
- [c4]Amos Fiat, Yishay Mansour, Uri Nadav:
Competitive queue management for latency sensitive packets. SODA 2008: 228-237 - 2007
- [c3]Amos Fiat, Yishay Mansour, Uri Nadav:
Efficient contention resolution protocols for selfish agents. SODA 2007: 179-188 - 2005
- [c2]Uri Nadav, Moni Naor:
The Dynamic And-Or Quorum System. DISC 2005: 472-486 - 2004
- [c1]Uri Nadav, Moni Naor:
Fault-Tolerant Storage in a Dynamic Environment. DISC 2004: 390-404
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
