12 citations · 12 across the 2 of their papers we have counts for
3 papers
cs.GT2021
An Improved Bound for the Tree Conjecture in Network Creation Games
Jack Dippel, Adrian Vetta
We study Nash equilibria in the network creation game of Fabrikant et al.[10]. In this game a vertex can buy an edge to another vertex for a cost of , and the objective of each…
cs.GT2019
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…
cs.DS2018★ 12 cited
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…