Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Uri Nadav"'
Autor:
Patrick Hummel, Uri Nadav
Publikováno v:
WWW
This paper analyzes a mechanism for selling items in auctions in which the auctioneer specifies a cap on the ratio between the maximum and minimum bids that bidders may use in the different auctions. Such a mechanism is widely used in online advertis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4a2f7dd77e60b7c9bdbc03b71406bc80
https://doi.org/10.1145/3178876.3186038
https://doi.org/10.1145/3178876.3186038
Publikováno v:
WWW
We model the strategic decisions of web sites in content markets, where sites may reduce user search cost by aggregating content. Example aggregations include political news, technology, and other niche-topic websites. We model this market scenario a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d87163a81f65c0d2f74fb082b3bcd84e
https://doi.org/10.1145/2187836.2187911
https://doi.org/10.1145/2187836.2187911
Autor:
Hu Fu, Mohammad Mahdian, Patrick R. Jordan, Inbal Talgam-Cohen, Sergei Vassilvitskii, Uri Nadav
Publikováno v:
INFOCOM Workshops
Algorithmic Game Theory ISBN: 9783642339950
SAGT
Algorithmic Game Theory ISBN: 9783642339950
SAGT
The holy grail of online advertising is to target users with ads matched to their needs with such precision that the users respond to the ads, thereby increasing both advertisers' and users' value. The current approach to this challenge utilizes info
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d2980722bf2e8107d5b4552c7dd66655
https://doi.org/10.1109/infcomw.2012.6193486
https://doi.org/10.1109/infcomw.2012.6193486
Publikováno v:
CDC/ECC
We study resource allocation games where allocations to agents are made in proportion to their bids. We show that the existence of a potential function in the allocation space, and a virtual price function are sufficient for the convergence of better
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca554e402d1b752fc53150bb2758de7b
https://doi.org/10.1109/cdc.2011.6160986
https://doi.org/10.1109/cdc.2011.6160986
Autor:
Uri Nadav, Georgios Piliouras
Publikováno v:
Algorithmic Game Theory ISBN: 9783642161698
Cournot and Bertrand oligopolies constitute the two most prevalent models of firm competition. The analysis of Nash equilibria in each model reveals a unique prediction about the stable state of the system. Quite alarmingly, despite the similarities
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d735ae97535ef932b39f3e923d558204
https://doi.org/10.1007/978-3-642-16170-4_26
https://doi.org/10.1007/978-3-642-16170-4_26
Autor:
Uri Nadav, Tim Roughgarden
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642175718
WINE
WINE
We show a formal duality between certain equilibrium concepts, including the correlated and coarse correlated equilibrium, and analysis frameworks for proving bounds on the price of anarchy for such concepts. Our first application of this duality is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::37627605848104b4ff49e9eba63f7a4e
https://doi.org/10.1007/978-3-642-17572-5_26
https://doi.org/10.1007/978-3-642-17572-5_26
Publikováno v:
LATIN 2010: Theoretical Informatics ISBN: 9783642121999
LATIN
LATIN
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:
https://explore.openaire.eu/search/publication?articleId=doi_________::5b764b7b3c404ce885bbbce36113ae4c
https://doi.org/10.1007/978-3-642-12200-2_49
https://doi.org/10.1007/978-3-642-12200-2_49
Publikováno v:
STOC
We study a general sub-class of concave games which we call socially concave games. We show that if each player follows any no-external regret minimization procedure then the dynamics will converge in the sense that both the average action vector wil
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5da0fb5d65730ee6ee41cbbbef2567b2
https://doi.org/10.1145/1536414.1536486
https://doi.org/10.1145/1536414.1536486
Publikováno v:
WWW
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 optimize
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d33e03446345f5c5651eeb2c8ddbb71
https://doi.org/10.1145/1526709.1526741
https://doi.org/10.1145/1526709.1526741
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540291633
DISC
DISC
We investigate issues related to the probe complexity of the And-Or quorum system and its implementation in a dynamic environment. Our contribution is twofold: We first analyze the algorithmic probe complexity of the And-Or quorum system, and present
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3d8f97761bcb3ca49809d8a2b90b264c
https://doi.org/10.1007/11561927_34
https://doi.org/10.1007/11561927_34