4 citations · 5 across the 7 of their papers we have counts for
9 papers
Efficient Elicitation of Collective Disagreements
Mohamed Ouaguenouni, Felipe Garrido-Lucero, Umberto Grandi +2
We analyze the structure of the disagreement among a population of voters over a set of alternatives. Surveys typically ask either for pairwise comparisons, simple and intuitive fo…
Prophet Inequalities with Delayed and Uncertain Acceptance
Emile Martinez, Felipe Garrido-Lucero, Umberto Grandi +1
We introduce the *prophet inequality with delayed and uncertain acceptance* model, a variant of the classical prophet inequality in which a decision-maker sequentially evaluates op…
Stability in Online Assignment Games
Emile Martinez, Felipe Garrido-Lucero, Umberto Grandi
The assignment game models a housing market where buyers and sellers are matched, and transaction prices are set so that the resulting allocation is stable. Shapley and Shubik show…
Algorithmic Shortlisting in Participatory Budgeting
Juan Zambrano, Juan Ignacio Zambrano, Clément Contet +5
Participatory budgeting is a democratic innovation that allows citizens to propose and vote on public investment projects. To help organizers manage large volumes of submissions, w…
Two-Sided Matching with Resource-Regional Caps
Felipe Garrido-Lucero, Denis Sokolov, Patrick Loiseau +1
We study two-sided many-to-one matching problems under a novel type of distributional constraints, resource-regional caps. In the context of college admissions, under resource-regi…
The Price of Opportunity Fairness in Matroid Allocation Problems
Rémi Castera, Felipe Garrido-Lucero, Patrick Loiseau +3
We consider matroid allocation problems under opportunity fairness constraints: resources need to be allocated to a set of agents under matroid constraints (which include classical…
DU-Shapley: A Shapley Value Proxy for Efficient Dataset Valuation
Felipe Garrido-Lucero, Benjamin Heymann, Maxime Vono +2
We consider the dataset valuation problem, that is, the problem of quantifying the incremental gain, to some relevant pre-defined utility of a machine learning task, of aggregating…
Polytime Algorithms for One-to-Many Matching Games
Felipe Garrido-Lucero, Rida Laraki
Matching games is a novel matching model introduced by Garrido-Lucero and Laraki, in which agents' utilities are endogenously determined as the outcome of a strategic game they pla…
Stable Matching Games
Felipe Garrido-Lucero, Rida Laraki
Gale and Shapley introduced a matching problem between two sets of agents where each agent on one side has an exogenous preference ordering over the agents on the other side. They…