25 citations · 57 across the 24 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.GT2012★ 1 cited
Improving the H_k-Bound on the Price of Stability in Undirected Shapley Network Design Games
Yann Disser, Andreas Emil Feldmann, Max Klimm +1
In this paper we show that the price of stability of Shapley network design games on undirected graphs with k players is at most (k^3(k+1)/2-k^2) / (1+k^3(k+1)/2-k^2) H_k = (1 - Θ(…
cs.CG2012★ 3 cited
Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons
Jérémie Chalopin, Shantanu Das, Yann Disser +2
This paper gives an introduction to the problem of mapping simple polygons with autonomous agents. We focus on minimalistic agents that move from vertex to vertex along straight li…