Minimality of Solution Update in Conflict Resolution: An Application of Revision Programming to von Neumann-Morgenstern Approach

Authors

Inna Pivkina
Vladik Kreinovich, The University of Texas at El PasoFollow

Publication Date

11-2003

Comments

Technical Report: UTEP-CS-03-29

Published in International Journal of Intelligent Systems, 2005, Vol. 20, No. 9, pp. 939-956.

Abstract

In a 1944 book that started game theory (and mathematical approach to conflict resolution), von Neumann and Morgenstern proposed the notion of a solution. When the situation changes, the old solution is often no longer a solution, so it needs to be updated. In practical applications, it is usually desirable to keep the solution change "minimal" in some reasonable sense. We show that for a seemingly straightforward formalization of this minimality, checking whether a change is minimal is NP-hard. We also show that by representing the notion of a solution as a collection of revision rules, we can produce a reasonable notion of minimality for which there exists a feasible algorithm for checking minimality of update.