We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
Existing work on menu techniques has shown linear menus to be less efficient and reliable for menuing tasks when compared to radial menus. With the rise in popularity of 3D spatia...
Dustin B. Chertoff, Ross W. Byers, Joseph J. LaVio...
We study the convergence time of Nash dynamics in two classes of congestion games – constant player congestion games and bounded jump congestion games. It was shown by Ackermann ...
In this paper we describe our prototyping environment to study concepts for empowering a single user to control robotic multi-agent systems. We investigate and validate these conc...
Michael Lichtenstern, Martin Frassl, Bernhard Peru...
Collection recommender systems suggest groups of items that work well as a whole. The interaction effects between items is an important consideration, but the vast space of possib...