2 citations · 2 across the 2 of their papers we have counts for
5 papers
Drawing Competitive Districts in Redistricting
Gabriel Chuang, Oussama Hanguir, Clifford Stein
In the process of redistricting, one important metric is the number of competitive districts, that is, districts where both parties have a reasonable chance of winning a majority o…
Learning Low Degree Hypergraphs
Eric Balkanski, Oussama Hanguir, Shatian Wang
We study the problem of learning a hypergraph via edge detecting queries. In this problem, a learner queries subsets of vertices of a hidden hypergraph and observes whether these s…
Optimizing for Strategy Diversity in the Design of Video Games
Oussama Hanguir, Will Ma, Christopher Thomas Ryan +1
We consider the problem of designing a linear program that has diverse solutions as the right-hand side varies. This problem arises in video game settings where designers aim to ha…
Matching Drivers to Riders: A Two-stage Robust Approach
Omar El Housni, Vineet Goyal, Oussama Hanguir +1
Matching demand (riders) to supply (drivers) efficiently is a fundamental problem for ride-sharing platforms who need to match the riders (almost) as soon as the request arrives wi…
Distributed Algorithms for Matching in Hypergraphs
Oussama Hanguir, Clifford Stein
We study the -Uniform Hypergraph Matching (-UHM) problem: given an -vertex hypergraph where every hyperedge is of size , find a maximum cardinality set of disjoi…