Proceedings of the Federated Conference on Computer Science and Information Systems pp. 597–603 ISBN 978-83-60810-22-4 Computing Equilibria for Constraint-based Negotiation Games with Interdependent Issues

Abstract—Negotiation with interdependent issues and nonlinear, non-monotonic utility functions is difficult because it is hard to efficiently explore the contract space. This paper presents a new result in automated negotiations with interdependent issues, complete information and time constraints. We consider that agents express their preferences using constraints defined as one interval per issue and that we represent their constraint sets as intersection graphs. We model negotiations as a bargaining game and we show that the equilibrium solution is one of the maximal cliques of the constraint graph. Consequently, we find that the problem of computing the equilibrium solution has polynomialtime complexity when the number of issues is fixed. I