1 citations · 1 across the 1 of their papers we have counts for
4 papers
Dynamic Necklace Splitting
Rishi Advani, Abolfazl Asudeh, Mohsen Dehghankar +1
The necklace splitting problem is a classic problem in fair division with many applications, including data-informed fair hash maps. We extend necklace splitting to a dynamic setti…
Decentralized Fair Division
Joel Miller, Rishi Advani, Ian Kash +2
Fair division is typically framed from a centralized perspective. However, in practice resource allocation often occurs via decentralized networks. We study a decentralized variant…
Random Projections and Dimension Reduction
Rishi Advani, Madison Crim, Sean O'Hagan
This paper, broadly speaking, covers the use of randomness in two main areas: low-rank approximation and kernel methods. Low-rank approximation is very important in numerical linea…
On the Prevalence of Bridge Graphs Among Non-3-Connected Cubic Non-Hamiltonian Graphs
Rishi Advani
There is empirical evidence supporting the claim that almost all cubic non-Hamiltonian graphs are bridge graphs. In this paper, we pose a related conjecture and prove that the orig…