Zobrazeno 1 - 10
of 863
pro vyhledávání: '"Kehne A"'
Publikováno v:
Journal of Pain Research, Vol Volume 16, Pp 2321-2330 (2023)
Adrianne Kehne,1,2 Steven J Bernstein,1– 3 Jennifer Thomas,1 Mark C Bicket,3,4,* Amy SB Bohnert,2– 4,* Erin Fanning Madden,5,* Victoria D Powell,6,7,* Pooja Lagisetty1– 3 1Division of General Medicine, Department of Internal Med
Externí odkaz:
https://doaj.org/article/4b035a09f5fd44eea7b85f0389eafca6
Publikováno v:
Journal of Pain Research, Vol Volume 16, Pp 1559-1571 (2023)
Aleksandra Zarska,1 Stephanie Slat,1 Adrianne Kehne,1,2 Colin Macleod,1 Heather Rye,3 Cheryl Dehmlow,4 Paul Hilliard,5 Kaitlyn Jaffe,6 Pooja Lagisetty1,2 1Department of Internal Medicine, University of Michigan, Ann Arbor, MI, USA; 2Center for Clinic
Externí odkaz:
https://doaj.org/article/8dfd6e594ee2465ca07913bda607393e
We study online contention resolution schemes (OCRSs) and prophet inequalities for non-product distributions. Specifically, when the active set is sampled according to a pairwise-independent (PI) distribution, we show a $(1-o_k(1))$-selectable OCRS f
Externí odkaz:
http://arxiv.org/abs/2406.15876
We study multi-buyer multi-item sequential item pricing mechanisms for revenue maximization with the goal of approximating a natural fractional relaxation -- the ex ante optimal revenue. We assume that buyers' values are subadditive but make no assum
Externí odkaz:
http://arxiv.org/abs/2404.14679
In computational social choice, the distortion of a voting rule quantifies the degree to which the rule overcomes limited preference information to select a socially desirable outcome. This concept has been investigated extensively, but only through
Externí odkaz:
http://arxiv.org/abs/2306.15657
In the stochastic set cover problem (Grandoni et al., FOCS '08), we are given a collection $\mathcal{S}$ of $m$ sets over a universe $\mathcal{U}$ of size $N$, and a distribution $D$ over elements of $\mathcal{U}$. The algorithm draws $n$ elements on
Externí odkaz:
http://arxiv.org/abs/2304.02063
Platforms for online civic participation rely heavily on methods for condensing thousands of comments into a relevant handful, based on whether participants agree or disagree with them. These methods should guarantee fair representation of the partic
Externí odkaz:
http://arxiv.org/abs/2211.15608
We give a polynomial-time algorithm for OnlineSetCover with a competitive ratio of $O(\log mn)$ when the elements are revealed in random order, essentially matching the best possible offline bound of $O(\log n)$ and circumventing the $\Omega(\log m \
Externí odkaz:
http://arxiv.org/abs/2111.06842
Autor:
Irani, Emaun, Macleod, Colin, Slat, Stephanie, Kehne, Adrianne, Madden, Erin, Jaffe, Kaitlyn, Bohnert, Amy, Lagisetty, Pooja
Publikováno v:
In Drug and Alcohol Dependence Reports June 2024 11
We study market interactions in which buyers are allowed to credibly reveal partial information about their types to the seller. Previous recent work has studied the special case of one buyer and one good, showing that such communication can simultan
Externí odkaz:
http://arxiv.org/abs/2106.13882