25 citations · 40 across the 13 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.GT2013
Tree Nash Equilibria in the Network Creation Game
Akaki Mamageishvili, Matus Mihalak, Dominik Muller
In the network creation game with n vertices, every vertex (a player) buys a set of adjacent edges, each at a fixed amount α > 0. It has been conjectured that for α >= n, every Nas…
cs.DS2013
Counting approximately-shortest paths in directed acyclic graphs
Matúš Mihalák, Rastislav Šrámek, Peter Widmayer
Given a directed acyclic graph with positive edge-weights, two vertices s and t, and a threshold-weight L, we present a fully-polynomial time approximation-scheme for the problem o…