Zobrazeno 1 - 10
of 104
pro vyhledávání: '"Nicole Immorlica"'
Publikováno v:
FOCS
We consider Bandits with Knapsacks (henceforth, BwK), a general model for multi-armed bandits under supply/budget constraints. In particular, a bandit algorithm needs to solve a well-known knapsack problem: find an optimal packing of items into a lim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dc14322f3986bb8cbd19c1836dc7d0bb
https://doi.org/10.1145/3557045
https://doi.org/10.1145/3557045
Publikováno v:
ACM Transactions on Economics and Computation. 9:1-34
Assortment optimization refers to the problem of designing a slate of products to offer potential customers, such as stocking the shelves in a convenience store. The price of each product is fixed in advance, and a probabilistic choice function descr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7e779ed2a0e8d63eefa5d4db9f732eff
https://doi.org/10.1145/3434415
https://doi.org/10.1145/3434415
Autor:
Matthew J. Bietz, Nitesh Goyal, Nicole Immorlica, Blair MacIntyre, Andrés Monroy-Hernández, Benjamin C. Pierce, Sean Rintel, Donghee Yvette Wohn
Publikováno v:
CHI Conference on Human Factors in Computing Systems Extended Abstracts.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f8bd90c416397050521818eabfca8b4
https://doi.org/10.1145/3491101.3503713
https://doi.org/10.1145/3491101.3503713
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::12f1cb7f329205a847fa6fc51e511ad0
https://doi.org/10.2139/ssrn.4113505
https://doi.org/10.2139/ssrn.4113505
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c7565bb6db68f0dda3894c2529296756
https://doi.org/10.2139/ssrn.4038899
https://doi.org/10.2139/ssrn.4038899
Publikováno v:
Web and Internet Economics ISBN: 9783030946753
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cba2ccfca90c2db4b9a7793ec9832a00
https://doi.org/10.1007/978-3-030-94676-0_7
https://doi.org/10.1007/978-3-030-94676-0_7
Publikováno v:
EC
We study the design of a decentralized two-sided matching market in which agents’ search is guided by the platform. There are finitely many agent types, each with (potentially random) preferences drawn from known type-specific distributions. Equipp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::19038f06d6d6a71661f05e9dbce25984
https://doi.org/10.1145/3465456.3467530
https://doi.org/10.1145/3465456.3467530
We study a model of social learning and communication using hard anecdotal evidence. There are two Bayesian agents (a sender and a receiver) who wish to communicate. The receiver must take an action whose payoff depends on their personal preferences
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9cd139b5ac295dc29db5fdba3b17171c
https://doi.org/10.3386/w28661
https://doi.org/10.3386/w28661
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe799fb7be56034582615e34e002e451
https://doi.org/10.2139/ssrn.3824538
https://doi.org/10.2139/ssrn.3824538
Publikováno v:
IJCAI
Motivated by applications such as college admission and insurance rate determination, we propose an evaluation problem where the inputs are controlled by strategic individuals who can modify their features at a cost. A learner can only partially obse
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::79afe2d0b2349919b88458b4fecc5a5e
http://arxiv.org/abs/2011.01956
http://arxiv.org/abs/2011.01956