Zobrazeno 1 - 10
of 55
pro vyhledávání: '"Rastegari, Baharak"'
We study approval-based committee voting in which a target number of candidates are selected based on voters' approval preferences over candidates. In contrast to most of the work, we consider the setting where voters express uncertain approval prefe
Externí odkaz:
http://arxiv.org/abs/2407.19391
Autor:
Meeks, Kitty, Rastegari, Baharak
Many important stable matching problems are known to be NP-hard, even when strong restrictions are placed on the input. In this paper we seek to identify structural properties of instances of stable matching problems which will allow us to design eff
Externí odkaz:
http://arxiv.org/abs/1708.04109
The assignment problem is one of the most well-studied settings in social choice, matching, and discrete allocation. We consider the problem with the additional feature that agents' preferences involve uncertainty. The setting with uncertainty leads
Externí odkaz:
http://arxiv.org/abs/1609.02795
Autor:
Aziz, Haris, Biró, Péter, Gaspers, Serge, de Haan, Ronald, Mattei, Nicholas, Rastegari, Baharak
We consider the two-sided stable matching setting in which there may be uncertainty about the agents' preferences due to limited information or communication. We consider three models of uncertainty: (1) lottery model --- in which for each agent, the
Externí odkaz:
http://arxiv.org/abs/1607.02917
The stable marriage problem and its extensions have been extensively studied, with much of the work in the literature assuming that agents fully know their own preferences over alternatives. This assumption however is not always practical (especially
Externí odkaz:
http://arxiv.org/abs/1602.04792
Autor:
Rastegari, Baharak
Two classes of widely studied markets are auctions, such as eBay, and two-sided matching markets, such as matching medical residents to hospitals. In both of these markets, it often happens that one side is in power and can influence the outcome of t
Externí odkaz:
http://hdl.handle.net/2429/45695
Autor:
Cechlárová, Katarína, Eirinakis, Pavlos, Fleiner, Tamás, Magos, Dimitrios, Manlove, David, Mourtos, Ioannis, Oceláková, Eva, Rastegari, Baharak
We consider Pareto-optimal matchings (POMs) in a many-to-many market of applicants and courses where applicants have preferences, which may include ties, over individual courses and lexicographic preferences over sets of courses. Since this is the mo
Externí odkaz:
http://arxiv.org/abs/1507.02866
Autor:
Rastegari, Baharak
RNA secondary structure prediction is an important problem in computational molecular biology. Experiments show that existing polynomial time prediction algorithms have limited success in predicting correctly the base pairs, i.e. secondary structure,
Externí odkaz:
http://hdl.handle.net/2429/15658
We study the House Allocation problem (also known as the Assignment problem), i.e., the problem of allocating a set of objects among a set of agents, where each agent has ordinal preferences (possibly involving ties) over a subset of the objects. We
Externí odkaz:
http://arxiv.org/abs/1404.5245
Publikováno v:
In Artificial Intelligence November 2019 276:57-78
