3 citations · 6 across the 7 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2015
The Shortest Connection Game
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
We introduce Shortest Connection Game, a two-player game played on a directed graph with edge costs. Given two designated vertices in which they start, the players take turns in ch…
cs.GT2014
Group Activity Selection Problem
Andreas Darmann, Edith Elkind, Sascha Kurz +3
We consider a setting where one has to organize one or several group activities for a set of agents. Each agent will participate in at most one activity, and her preferences over a…