activity
20172020
most citedStrategic Classification from Revealed Preferences

6 citations · 12 across the 3 of their papers we have counts for

collaborators

7 papers

cs.LG2020

Algorithms and Learning for Fair Portfolio Design

Emily Diana, Travis Dick, Hadi Elzayn +5

We consider a variation on the classical finance problem of optimal portfolio design. In our setting, a large population of consumers is drawn from some distribution over risk tole…

math.OC20194 cited

Geometry of Graph Partitions via Optimal Transport

Tara Abrishami, Nestor Guillen, Parker Rule +4

We define a distance metric between partitions of a graph using machinery from optimal transport. Our metric is built from a linear assignment problem that matches partition compon…

cs.GT20192 cited

Equilibrium Characterization for Data Acquisition Games

Jinshuo Dong, Hadi Elzayn, Shahin Jabbari +2

We study a game between two firms in which each provide a service based on machine learning. The firms are presented with the opportunity to purchase a new corpus of data, which wi…

cs.GT2019

Price of Privacy in the Keynesian Beauty Contest

Hadi Elzayn, Zachary Schutzman

The Keynesian Beauty Contest is a classical game in which strategic agents seek to both accurately guess the true state of the world as well as the average action of all agents. We…

math.OC2018

Total Variation Isoperimetric Profiles

Daryl DeFord, Hugo Lavenant, Zachary Schutzman +1

Applications such as political redistricting demand quantitative measures of geometric compactness to distinguish between simple and contorted shapes. While the isoperimetric quoti…

cs.LG2018

Fair Algorithms for Learning in Allocation Problems

Hadi Elzayn, Shahin Jabbari, Christopher Jung +4

Settings such as lending and policing can be modeled by a centralized agent allocating a resource (loans or police officers) amongst several groups, in order to maximize some objec…