34 citations · 171 across the 39 of their papers we have counts for
41 papers
Kernel Methods for Refined Prophet Inequalities
Patrick Loiseau, Mathieu Molina, Vianney Perchet +2
The single-selection prophet inequality is a canonical Bayesian online selection problem in which independent nonnegative values arrive sequentially and the decision-maker must irr…
An Asymptotic Analysis of the Shapley Value for Dataset Valuation
Mélissa Tamine, Benjamin Heymann, Maxime Vono +1
We propose an asymptotic analysis of the Shapley value in a dataset valuation setting in which utilities are modeled as smooth functionals of empirical distributions via reproducin…
Counterfactually Fair Regression via Optimal Transport
M. Generali Lince, S. Gaucher, J-J. Vie +1
We consider the problem of learning a counterfactually fair regressor. We adopt a causal uncertainty view in which counterfactual fairness is defined with resampled noise. We focus…
Trading-off price for data quality to achieve fair online allocation
Mathieu Molina, Nicolas Gast, Patrick Loiseau +1
We consider the problem of online allocation subject to a long-term fairness penalty. Contrary to existing works, however, we do not assume that the decision-maker observes the pro…
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…
Understanding Blockchain Governance: Analyzing Decentralized Voting to Amend DeFi Smart Contracts
Johnnatan Messias, Vabuk Pahari, Balakrishnan Chandrasekaran +2
Decentralized Autonomous Organizations (DAOs) have emerged as a novel governance mechanism in blockchain ecosystems, particularly within Decentralized Finance (DeFi). By enabling t…
Dissecting Bitcoin and Ethereum Transactions: On the Lack of Transaction Contention and Prioritization Transparency in Blockchains
Johnnatan Messias, Vabuk Pahari, Balakrishnan Chandrasekaran +2
In permissionless blockchains, transaction issuers include a fee to incentivize miners to include their transactions. To accurately estimate this prioritization fee for a transacti…
Bounding and Approximating Intersectional Fairness through Marginal Fairness
Mathieu Molina, Patrick Loiseau
Discrimination in machine learning often arises along multiple dimensions (a.k.a. protected attributes); it is then desirable to ensure \emph{intersectional fairness} -- i.e., that…
Fairness in Selection Problems with Strategic Candidates
Vitalii Emelianov, Nicolas Gast, Patrick Loiseau
To better understand discriminations and the effect of affirmative actions in selection problems (e.g., college admission or hiring), a recent line of research proposed a model bas…
Pareto-Optimal Fairness-Utility Amortizations in Rankings with a DBN Exposure Model
Till Kletti, Jean-Michel Renders, Patrick Loiseau
In recent years, it has become clear that rankings delivered in many areas need not only be useful to the users but also respect fairness of exposure for the item producers. We con…
Introducing the Expohedron for Efficient Pareto-optimal Fairness-Utility Amortizations in Repeated Rankings
Till Kletti, Jean-Michel Renders, Patrick Loiseau
We consider the problem of computing a sequence of rankings that maximizes consumer-side utility while minimizing producer-side individual unfairness of exposure. While prior work…
On Fair Selection in the Presence of Implicit and Differential Variance
Vitalii Emelianov, Nicolas Gast, Krishna P. Gummadi +1
Discrimination in selection problems such as hiring or college admission is often explained by implicit bias from the decision maker against disadvantaged demographic groups. In th…
Selfish & Opaque Transaction Ordering in the Bitcoin Blockchain: The Case for Chain Neutrality
Johnnatan Messias, Mohamed Alzayat, Balakrishnan Chandrasekaran +3
Most public blockchain protocols, including the popular Bitcoin and Ethereum blockchains, do not formally specify the order in which miners should select transactions from the pool…
Modeling Coordinated vs. P2P Mining: An Analysis of Inefficiency and Inequality in Proof-of-Work Blockchains
Mohamed Alzayat, Johnnatan Messias, Balakrishnan Chandrasekaran +2
We study efficiency in a proof-of-work blockchain with non-zero latencies, focusing in particular on the (inequality in) individual miners' efficiencies. Prior work attributed diff…
Scalable Optimal Classifiers for Adversarial Settings under Uncertainty
Patrick Loiseau, Benjamin Roussillon
We consider the problem of finding optimal classifiers in an adversarial setting where the class-1 data is generated by an attacker whose objective is not known to the defender --…
Asymptotic Degradation of Linear Regression Estimates With Strategic Data Sources
Benjamin Roussillon, Nicolas Gast, Patrick Loiseau +1
We consider the problem of linear regression from strategic data sources with a public good component, i.e., when data is provided by strategic agents who seek to minimize an indiv…
Colonel Blotto Games with Favoritism: Competitions with Pre-allocations and Asymmetric Effectiveness
Dong Quan Vu, Patrick Loiseau
We introduce the Colonel Blotto game with favoritism, an extension of the famous Colonel Blotto game where the winner-determination rule is generalized to include pre-allocations a…
On Fair Selection in the Presence of Implicit Variance
Vitalii Emelianov, Nicolas Gast, Krishna P. Gummadi +1
Quota-based fairness mechanisms like the so-called Rooney rule or four-fifths rule are used in selection problems such as hiring or college admission to reduce inequalities based o…
Path Planning Problems with Side Observations-When Colonels Play Hide-and-Seek
Dong Quan Vu, Patrick Loiseau, Alonso Silva +1
Resource allocation games such as the famous Colonel Blotto (CB) and Hide-and-Seek (HS) games are often used to model a large variety of practical problems, but only in their one-s…
Approximate Equilibria in Generalized Colonel Blotto and Generalized Lottery Blotto Games
Dong Quan Vu, Patrick Loiseau, Alonso Silva
In the Colonel Blotto game, two players with a fixed budget simultaneously allocate their resources across n battlefields to maximize the aggregate value gained from the battlefiel…
Nonzero-sum Adversarial Hypothesis Testing Games
Sarath Yasodharan, Patrick Loiseau
We study nonzero-sum hypothesis testing games that arise in the context of adversarial classification, in both the Bayesian as well as the Neyman-Pearson frameworks. We first show…
Combinatorial Bandits for Sequential Learning in Colonel Blotto Games
Dong Quan Vu, Patrick Loiseau, Alonso Silva
The Colonel Blotto game is a renowned resource allocation problem with a long-standing literature in game theory (almost 100 years). However, its scope of application is still rest…
The Price of Local Fairness in Multistage Selection
Vitalii Emelianov, George Arvanitakis, Nicolas Gast +2
The rise of algorithmic decision making led to active researches on how to define and guarantee fairness, mostly focusing on one-shot decision making. In several important applicat…
Path Planning Problems with Side Observations-When Colonels Play Hide-and-Seek
Dong Quan Vu, Patrick Loiseau, Alonso Silva +1
Resource allocation games such as the famous Colonel Blotto (CB) and Hide-and-Seek (HS) games are often used to model a large variety of practical problems, but only in their one-s…