Zobrazeno 1 - 10
of 528
pro vyhledávání: '"Christodoulou, George"'
We study the problem of fairly allocating indivisible goods among agents which are equipped with {\em leveled} valuation functions. Such preferences, that have been studied before in economics and fair division literature, capture a simple and intuit
Externí odkaz:
http://arxiv.org/abs/2407.05891
Our work revisits the design of mechanisms via the learning-augmented framework. In this model, the algorithm is enhanced with imperfect (machine-learned) information concerning the input, usually referred to as prediction. The goal is to design algo
Externí odkaz:
http://arxiv.org/abs/2406.14165
Autor:
Psarakis, Kyriakos, Siachamis, George, Christodoulou, George, Fragkoulis, Marios, Katsifodimos, Asterios
Developing stateful cloud applications, such as low-latency workflows and microservices with strict consistency requirements, remains arduous for programmers. The Stateful Functions-as-a-Service (SFaaS) paradigm aims to serve these use cases. However
Externí odkaz:
http://arxiv.org/abs/2312.06893
Noam Nisan and Amir Ronen conjectured that the best approximation ratio of deterministic truthful mechanisms for makespan-minimization for $n$ unrelated machines is $n$. This work validates the conjecture.
Externí odkaz:
http://arxiv.org/abs/2301.11905
We study a participatory budgeting problem, where a set of strategic agents wish to split a divisible budget among different projects, by aggregating their proposals on a single division. Unfortunately, the straight-forward rule that divides the budg
Externí odkaz:
http://arxiv.org/abs/2203.09971
Publikováno v:
In Artificial Intelligence October 2024 335
We study truthful mechanisms for allocation problems in graphs, both for the minimization (i.e., scheduling) and maximization (i.e., auctions) setting. The minimization problem is a special case of the well-studied unrelated machines scheduling probl
Externí odkaz:
http://arxiv.org/abs/2106.03724
Indexing intervals is a fundamental problem, finding a wide range of applications. Recent work on managing large collections of intervals in main memory focused on overlap joins and temporal aggregation problems. In this paper, we propose novel and e
Externí odkaz:
http://arxiv.org/abs/2104.10939