Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Nadav, Uri"'
We consider the fundamental problem of selecting $k$ out of $n$ random variables in a way that the expected highest or second-highest value is maximized. This question captures several applications where we have uncertainty about the quality of candi
Externí odkaz:
http://arxiv.org/abs/2012.07935
Inspired by Internet ad auction applications, we study the problem of allocating a single item via an auction when bidders place very different values on the item. We formulate this as the problem of prior-free auction and focus on designing a simple
Externí odkaz:
http://arxiv.org/abs/0909.5365
Ad auctions in sponsored search support ``broad match'' that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving more expressiveness to advertisers, this feature makes it challenging to optimi
Externí odkaz:
http://arxiv.org/abs/0901.3754
Autor:
Hummel, Patrick, Nadav, Uri
Publikováno v:
ACM Transactions on Economics and Computation; 20240101, Issue: Preprints p1-33, 33p
Publikováno v:
Proceedings of the 21st International Conference World Wide Web; 4/16/2012, p549-558, 10p
Autor:
Fu, Hu, Jordan, Patrick, Mahdian, Mohammad, Nadav, Uri, Talgam-Cohen, Inbal, Vassilvits ii, Sergei
Publikováno v:
Algorithmic Game Theory (9783642339950); 2012, p168-179, 12p
Autor:
Hu Fu, Jordan, Patrick, Mahdian, Mohammad, Nadav, Uri, Talgam-Cohen, Inbal, Vassilvitskii, Sergei
Publikováno v:
2012 Proceedings IEEE INFOCOM Workshops; 1/ 1/2012, p184-189, 6p
Publikováno v:
IEEE Conference on Decision & Control & European Control Conference; 1/ 1/2011, p4479-4484, 6p
Autor:
Nadav, Uri, Roughgarden, Tim
Publikováno v:
Internet & Network Economics (9783642175718); 2010, p319-326, 8p
Autor:
Nadav, Uri, Piliouras, Georgios
Publikováno v:
Algorithmic Game Theory (9783642161698); 2010, p300-311, 12p