1 citations · 1 across the 4 of their papers we have counts for
6 papers
The Speed and Threshold of the Biased Hamilton Cycle Game
Noah Brustle, Sarah Clusiau, Vishnu V. Narayan +3
We show that there is a constant C such that for any , Maker wins the Maker-Breaker Hamilton cycle game in $n+\frac{Cn}{\sqrt{\ln{n}}}…
The Speed and Threshold of the Biased Perfect Matching Game
Noah Brustle, Sarah Clusiau, Vishnu V. Narayan +3
We show that Maker wins the Maker-Breaker perfect matching game in turns when the bias is at least , for any …
Online Coloring and a New Type of Adversary for Online Graph Problems
Yaqiao Li, Vishnu V. Narayan, Denis Pankratov
We introduce a new type of adversary for online graph problems. The new adversary is parameterized by a single integer , which upper bounds the number of connected components th…
One Dollar Each Eliminates Envy
Johannes Brustle, Jack Dippel, Vishnu V. Narayan +2
We study the fair division of a collection of indivisible goods amongst a set of agents. Whilst envy-free allocations typically do not exist in the indivisible goods settin…
The Declining Price Anomaly is not Universal in Multi-Buyer Sequential Auctions (but almost is)
Vishnu V. Narayan, Enguerrand Prebet, Adrian Vetta
The declining price anomaly states that the price weakly decreases when multiple copies of an item are sold sequentially over time. The anomaly has been observed in a plethora of p…
The Matching Augmentation Problem: A -Approximation Algorithm
Joe Cheriyan, Jack Dippel, Fabrizio Grandoni +2
We present a approximation algorithm for the matching augmentation problem (MAP): given a multi-graph with edges of cost either zero or one such that the edges of cost ze…