3 papers
cs.GT2015
Bribeproof mechanisms for two-values domains
Matúš Mihalák, Paolo Penna, Peter Widmayer
Schummer (Journal of Economic Theory 2000) introduced the concept of bribeproof mechanism which, in a context where monetary transfer between agents is possible, requires that mani…
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…
cs.CG2012
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…