3 citations · 6 across the 4 of their papers we have counts for
4 papers
Enforcing efficient equilibria in network design games via subsidies
John Augustine, Ioannis Caragiannis, Angelo Fanelli +1
The efficient design of networks has been an important engineering task that involves challenging combinatorial optimization problems. Typically, a network designer has to select a…
Dynamics of Profit-Sharing Games
John Augustine, Ning Chen, Edith Elkind +3
An important task in the analysis of multiagent systems is to understand how groups of selfish players can form coalitions, i.e., work together in teams. In this paper, we study th…
Energy-Efficient Shortest Path Algorithms for Convergecast in Sensor Networks
John Augustine, Qi Han, Philip Loden +2
We introduce a variant of the capacitated vehicle routing problem that is encountered in sensor networks for scientific data collection. Consider an undirected graph $G=(V \cup \{\…
Approximate Weighted Farthest Neighbors and Minimum Dilation Stars
John Augustine, David Eppstein, Kevin A. Wortman
We provide an efficient reduction from the problem of querying approximate multiplicatively weighted farthest neighbors in a metric space to the unweighted problem. Combining our t…