-
On the Verification and Computation of Strong Nash Equilibrium
Computing equilibria of games is a central task in computer science. A l...
read it
-
Bistable Probabilities: A Unified Framework for Studying Rationality and Irrationality in Classical and Quantum Games
This article presents a unified probabilistic framework that allows both...
read it
-
Automated Temporal Equilibrium Analysis: Verification and Synthesis of Multi-Player Games
In the context of multi-agent systems, the rational verification problem...
read it
-
Extensive Infinite Games and Escalation, an exercise in Agda
Escalation in games is when agents keep playing forever. Based on formal...
read it
-
The Complexity of Computational Problems about Nash Equilibria in Symmetric Win-Lose Games
We revisit the complexity of deciding, given a bimatrix game, whether i...
read it
-
The Temporary Exchange Problem
We formalize an allocation model under ordinal preferences that is more ...
read it
-
A Capacity-Price Game for Uncertain Renewables Resources
Renewable resources are starting to constitute a growing portion of the ...
read it
Individual Resource Games and Resource Redistributions
Research in multiagent systems is advancing and one can predict its future widespread implementation in real-world systems. One needs however to acknowledge that the agents evolving in the real world have limited access to resources. They have to seek after resource objectives and compete for those resources. We introduce a class of resource games where resources and preferences are described with the language of a resource-sensitive logic. We study three decision problems, the first of which is deciding whether an action profile is a Nash equilibrium. When dealing with resources, interesting questions arise as to whether some equilibria can be eliminated or constructed by a central authority by redistributing the available resources among the agents. In our economies, division of property in divorce law exemplifies how a central authority can redistribute the resources of individuals, and why they would desire to do so. We thus study two related decision problems: rational elimination and rational construction. We consider them in the contexts of dichotomous or parsimonious preferences, and of logics that admit or not the weakening rule. This permits us to offer a variety of algorithms and complexity results that are applicable to a large number of settings.
READ FULL TEXT
Comments
There are no comments yet.