Usually, to apply game-theoretic methods, we must specify utilities precisely, and we run the
risk that the solutions we compute are not robust to errors in this specification. Ordinal …

Significant work has been done on computational aspects of solving games under various
solution concepts, such as Nash equilibrium, subgame perfect Nash equilibrium, correlated …

We study pure-strategy Nash equilibria in multi-player concurrent deterministic games, for a
variety of preference relations. We provide a novel construction, called the suspect game …

Boolean games are a compact and expressive class of games, based on propositional logic.
However, Boolean games are computationally complex: checking for the existence of pure …

Nash equilibrium is often heralded as a guiding principle for rational decision-making in
strategic interactions. However, it is well-known that Nash equilibrium sometimes fails as a …

Negotiation is a very common interaction between agents. Many common negotiation
protocols work with cardinal utilities, even though ordinal preferences, which only rank the …

We introduce a class of resource games where resources and preferences are described
with the language of a resource-sensitive logic. We present two decision problems, the first …

In this article, we introduce fuzzy equilibrium logic as a generalization of both Pearce
equilibrium logic and fuzzy answer set programming. The resulting framework combines the …

In Rational Synthesis, we consider a multi-agent system in which some of the agents are
controllable and some are not. All agents have objectives, and the goal is to synthesize …

We survey some recent research regarding strategic behaviour in resource allocation
problems, focusing on the fair division of indivisible goods. We consider a number of …