Zobrazeno 1 - 10
of 188
pro vyhledávání: '"Vahab Mirrokni"'
Publikováno v:
Algorithms, Vol 12, Iss 8, p 162 (2019)
Balanced partitioning is often a crucial first step in solving large-scale graph optimization problems, for example, in some cases, a big graph can be chopped into pieces that fit on one machine to be processed independently before stitching the resu
Externí odkaz:
https://doaj.org/article/8d1a6e7032004694851ae66537b5a278
Publikováno v:
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3c31349045d614ebce72d30e75d6c508
https://doi.org/10.1145/3558481.3591318
https://doi.org/10.1145/3558481.3591318
Publikováno v:
Operations Research. 70:2299-2317
Efficient and Profit-Maximizing Dynamic Double Auctions for Two-Sided Markets Two-sided markets that enable sellers and buyers to trade have received considerable attention in the past decade. Prominent examples include online advertising, freelancin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::71913acfcee25453e378e6d7e9de870e
https://doi.org/10.1287/opre.2022.2266
https://doi.org/10.1287/opre.2022.2266
Publikováno v:
EC
We consider the setting where a seller must allocate a collection of goods to budgeted buyers, as exemplified by online advertising systems where platforms decide which impressions to serve to various advertisers. Such resource allocation problems ar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e0c8eec69ebc7dd56d305b69ffb63ef1
https://doi.org/10.1287/opre.2020.2049
https://doi.org/10.1287/opre.2020.2049
Autor:
MohammadHossein Bateni, Hossein Esfandiari, Hendrik Fichtenberger, Monika Henzinger, Rajesh Jayaram, Vahab Mirrokni, Andreas Wiese
Publikováno v:
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::07c4f6743ccd1062fca6aff64bd86501
https://doi.org/10.1137/1.9781611977554.ch101
https://doi.org/10.1137/1.9781611977554.ch101
We study autobidding ad auctions with user costs, where each bidder is value-maximizing subject to a return-over-investment (ROI) constraint, and the seller aims to maximize the social welfare taking into consideration the user's cost of viewing an a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::20bb7b9da1d323d680313a7bc8d6b13b
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::12ba168add6ef7292e48c8f95870e50a
https://doi.org/10.2139/ssrn.4351927
https://doi.org/10.2139/ssrn.4351927
Publikováno v:
Mathematical Programming.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::25ea50594b0e75fd545ca7dc0197ff4a
https://doi.org/10.1007/s10107-022-01910-8
https://doi.org/10.1007/s10107-022-01910-8
Publikováno v:
Operations Research. 69:1450-1467
We present a formal study of first-look and preferred deals that are a recently introduced generation of contracts for selling online advertisements, which generalize traditional reservation contracts and are suitable for advertisers with advanced ta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f3b9fba2ace7fcf8995bc57f262152b6
https://doi.org/10.1287/opre.2020.2087
https://doi.org/10.1287/opre.2020.2087
Publikováno v:
Proceedings of the International AAAI Conference on Web and Social Media. 5:486-489
Detecting coherent, well-connected communities in large graphs provides insight into the graph structure and can serve as the basis for content discovery. Clustering is a popular technique for community detection but global algorithms that examine th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::df2987bcb046e8193eb93b922f8d1b85
https://doi.org/10.1609/icwsm.v5i1.14191
https://doi.org/10.1609/icwsm.v5i1.14191