Zobrazeno 1 - 10
of 805
pro vyhledávání: '"Russo, Matteo"'
Autor:
Russo, Matteo, Celli, Andrea, Baldeschi, Riccardo Colini, Fusco, Federico, Haimovich, Daniel, Karamshuk, Dima, Leonardi, Stefano, Tax, Niek
In online learning, a decision maker repeatedly selects one of a set of actions, with the goal of minimizing the overall loss incurred. Following the recent line of research on algorithms endowed with additional predictive features, we revisit this p
Externí odkaz:
http://arxiv.org/abs/2407.16355
The online joint replenishment problem (JRP) is a fundamental problem in the area of online problems with delay. Over the last decade, several works have studied generalizations of JRP with different cost functions for servicing requests. Most prior
Externí odkaz:
http://arxiv.org/abs/2407.15809
We study the sublinear multivariate mean estimation problem in $d$-dimensional Euclidean space. Specifically, we aim to find the mean $\mu$ of a ground point set $A$, which minimizes the sum of squared Euclidean distances of the points in $A$ to $\mu
Externí odkaz:
http://arxiv.org/abs/2406.05254
In the classical principal-agent hidden-action model, a principal delegates the execution of a costly task to an agent for which he can choose among actions with different costs and different success probabilities to accomplish the task. To incentivi
Externí odkaz:
http://arxiv.org/abs/2402.16553
Autor:
Burkhardt, Jakob, Caragiannis, Ioannis, Fehrs, Karl, Russo, Matteo, Schwiegelshohn, Chris, Shyam, Sudarshan
Motivated by recent work in computational social choice, we extend the metric distortion framework to clustering problems. Given a set of $n$ agents located in an underlying metric space, our goal is to partition them into $k$ clusters, optimizing so
Externí odkaz:
http://arxiv.org/abs/2402.04035
Optimization problems often involve vector norms, which has led to extensive research on developing algorithms that can handle objectives beyond the $\ell_p$ norms. Our work introduces the concept of submodular norms, which are a versatile type of no
Externí odkaz:
http://arxiv.org/abs/2310.04548
We introduce the study of designing allocation mechanisms for fairly allocating indivisible goods in settings with interdependent valuation functions. In our setting, there is a set of goods that needs to be allocated to a set of agents (without disp
Externí odkaz:
http://arxiv.org/abs/2305.14096
Autor:
Avadhanula, Vashist, Celli, Andrea, Colini-Baldeschi, Riccardo, Leonardi, Stefano, Russo, Matteo
We study fully dynamic online selection problems in an adversarial/stochastic setting that includes Bayesian online selection, prophet inequalities, posted price mechanisms, and stochastic probing problems subject to combinatorial constraints. In the
Externí odkaz:
http://arxiv.org/abs/2301.03099
Autor:
Ezra, Tomer, Leonardi, Stefano, Reiffenhäuser, Rebecca, Russo, Matteo, Tsigonias-Dimitriadis, Alexandros
We consider prophet inequalities under downward-closed constraints. In this problem, a decision-maker makes immediate and irrevocable choices on arriving elements, subject to constraints. Traditionally, performance is compared to the expected offline
Externí odkaz:
http://arxiv.org/abs/2207.03361
Publikováno v:
In Mechatronics December 2024 104