Zobrazeno 1 - 10
of 502
pro vyhledávání: '"Aziz Haris"'
Large conferences such as NeurIPS and AAAI serve as crossroads of various AI fields, since they attract submissions from a vast number of communities. However, in some cases, this has resulted in a poor reviewing experience for some communities, whos
Externí odkaz:
http://arxiv.org/abs/2410.03474
Autor:
Aziz, Haris, Huang, Xin, Kimura, Kei, Saha, Indrajit, Sun, Zhaohong, Suzuki, Mashbat, Yokoo, Makoto
We consider the problem of fair allocation of indivisible items with subsidies when agents have weighted entitlements. After highlighting several important differences from the unweighted case, we present several results concerning weighted envy-free
Externí odkaz:
http://arxiv.org/abs/2408.08711
We study the problem of assigning agents to the vertices of a graph such that no pair of neighbors can benefit from swapping assignments -- a property we term neighborhood stability. We further assume that agents' utilities are based solely on their
Externí odkaz:
http://arxiv.org/abs/2407.05240
We study committee voting rules under ranked preferences, which map the voters' preference relations to a subset of the alternatives of predefined size. In this setting, the compatibility between proportional representation and committee monotonicity
Externí odkaz:
http://arxiv.org/abs/2406.19689
Understanding the agent's learning process, particularly the factors that contribute to its success or failure post-training, is crucial for comprehending the rationale behind the agent's decision-making process. Prior methods clarify the learning pr
Externí odkaz:
http://arxiv.org/abs/2406.14214
In pursuit of participatory budgeting (PB) outcomes with broader fairness guarantees, we initiate the study of lotteries over discrete PB outcomes. As the projects have heterogeneous costs, the amount spent may not be equal ex ante and ex post. To ad
Externí odkaz:
http://arxiv.org/abs/2404.05198
We study the envy-free house allocation problem when agents have uncertain preferences over items and consider several well-studied preference uncertainty models. The central problem that we focus on is computing an allocation that has the highest pr
Externí odkaz:
http://arxiv.org/abs/2312.11286
We consider the problem of locating a facility to serve a set of agents located along a line. The Nash welfare objective function, defined as the product of the agents' utilities, is known to provide a compromise between fairness and efficiency in re
Externí odkaz:
http://arxiv.org/abs/2310.04102