Zobrazeno 1 - 10
of 46
pro vyhledávání: '"Ezra, Tomer"'
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
Combinatorial contracts are emerging as a key paradigm in algorithmic contract design, paralleling the role of combinatorial auctions in algorithmic mechanism design. In this paper we study natural combinatorial contract settings involving teams of a
Externí odkaz:
http://arxiv.org/abs/2405.08260
We study the principal-agent setting, where a principal delegates the execution of a costly project to an agent. In the classical model, the agent chooses an action among a set of available actions. Every action is associated with some cost, and lead
Externí odkaz:
http://arxiv.org/abs/2403.09545
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
In Bayesian online settings, every element has a value that is drawn from a known underlying distribution, which we refer to as the element's identity. The elements arrive sequentially. Upon the arrival of an element, its value is revealed, and the d
Externí odkaz:
http://arxiv.org/abs/2402.17160
We consider the problem of designing auctions which maximize consumer surplus (i.e., the social welfare minus the payments charged to the buyers). In the consumer surplus maximization problem, a seller with a set of goods faces a set of strategic buy
Externí odkaz:
http://arxiv.org/abs/2402.16972
Autor:
Brustle, Johannes, Correa, José, Dütting, Paul, Ezra, Tomer, Feldman, Michal, Verdugo, Victor
We study the classic single-choice prophet inequality problem through a resource augmentation lens. Our goal is to bound the $(1-\varepsilon)$-competition complexity of different types of online algorithms. This metric asks for the smallest $k$ such
Externí odkaz:
http://arxiv.org/abs/2402.11084
Autor:
Ezra, Tomer, Garbuz, Tamar
We study the measure of order-competitive ratio introduced by Ezra et al. [2023] for online algorithms in Bayesian combinatorial settings. In our setting, a decision-maker observes a sequence of elements that are associated with stochastic rewards th
Externí odkaz:
http://arxiv.org/abs/2307.02610
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
Publikováno v:
EC '23: Proceedings of the 24th ACM Conference on Economics and Computation, 2023
Pandora's problem is a fundamental model in economics that studies optimal search strategies under costly inspection. In this paper we initiate the study of Pandora's problem with combinatorial costs, capturing many real-life scenarios where search c
Externí odkaz:
http://arxiv.org/abs/2303.01078