We introduce and study qualitative multiple outcomes games. These games are noncooperative games with qualitative utilities (i.e., values over an ordinal scale), strictly qualitat...
We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 − O(1/ log n), satisfies a constant fraction of constraints, wher...
The fields HCI/usability and computer games have existed for a few decades with virtually no mutual interaction. However, in recent years, a number of exchanges have appeared, bot...
This paper introduces a new game theoretic formulation for the design and routing of resilient and translucent networks. An integer linear programming (ILP) modeling is also presen...
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman