Search Results for author:
Found 3 papers, 0 papers with code
Characterization of Group-Fair Social Choice Rules under Single-Peaked Preferences
We study fairness in social choice settings under single-peaked preferences.
Indivisible Participatory Budgeting under Weak Rankings
The specific, important, research gap that we address in this paper is to propose classes of rules for indivisible PB with weak rankings (i. e., weak ordinal preferences) and investigate their key algorithmic and axiomatic issues.
Sleeping Combinatorial Bandits
An algorithm can select a subset of arms from the \emph{availability set} (sleeping bandits) and receive the corresponding reward along with semi-bandit feedback (combinatorial bandits).
Cannot find the paper you are looking for? You can
Submit a new open access paper.
