8 citations · 11 across the 5 of their papers we have counts for
6 papers
Last-Coverage Probabilities of Random Walks on Cycle Graphs for Symmetric, Biased, and Time-Dependent Walks
Kiyan Idnani, Jad Salem
This paper studies the last-coverage vertex of a nearest-neighbour random walk on a cycle: the vertex most likely to be the final one discovered. We show that the visited vertices…
Quantum Hypergraph Partitioning
Cameron Ibrahim, Bao G. Bach, Jad Salem +4
Quantum optimization algorithms are inherently probabilistic, yet they are most often used to search for a single high-quality solution. In this paper, we instead study hypergraph…
Learning Cut Distributions with Quantum Optimization
Bao Bach, Cameron Ibrahim, Reuben Tate +3
Many combinatorial optimization problems admit a maximin fairness variant, where the aim is to find a distribution over possible solutions which maximizes an expected worst-case ou…
Expected Maximin Fairness in Max-Cut and other Combinatorial Optimization Problems
Jad Salem, Reuben Tate, Stephan Eidenbenz
Maximin fairness is the ideal that the worst-off group (or individual) should be treated as well as possible. Literature on maximin fairness in various decision-making settings has…
Don't let Ricci v. DeStefano Hold You Back: A Bias-Aware Legal Solution to the Hiring Paradox
Jad Salem, Deven R. Desai, Swati Gupta
Companies that try to address inequality in employment face a hiring paradox. Failing to address workforce imbalance can result in legal sanctions and scrutiny, but proactive measu…
Algorithmic Challenges in Ensuring Fairness at the Time of Decision
Jad Salem, Swati Gupta, Vijay Kamble
Algorithmic decision-making in societal contexts, such as retail pricing, loan administration, recommendations on online platforms, etc., can be framed as stochastic optimization u…