Abstract
We provide a new representation for nonlinear utility spaces by adopting a modular decomposition of the issues and the constraints. This is based on the intuition that constraint-based utility spaces are nonlinear with respect to issues, but linear with respect to the constraints. The result is a mapping from a utility space into an issue-constraint hypergraph with the underling interdependencies. Exploring the utility space reduces then to a message passing mechanism along the hyperedges by means of utility propagation. The optimal contracts are efficiently found using a variation of the Max-Sum algorithm. We experimentally evaluate the model using parameterized random nonlinear utility spaces, showing that it can handle a large family of complex utility spaces using several exploration strategies. We also evaluate the complexity of the generated utility spaces using the entropy and establish an optimal search strategy allowing a better scaling of the model.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Bacchus, F., Grove, A.: Graphical models for preference and utility. In: Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence, UAI’95, pp. 3–10. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (1995)
Chajewska, U., Koller, D.: Utilities as random variables: density estimation and structure discovery. In: Proceedings of the Sixteenth Annual Conference on Uncertainty in Artificial Intelligence (UAI-00), pp. 63–71 (2000)
Donoho, D.L.: High-dimensional data analysis: the curses and blessings of dimensionality. In: American Mathematical Society Conference. Mathematical Challenges of the 21st Century (2000)
Fujita, K., Ito, T., Klein, M.: An approach to scalable multi-issue negotiation: decomposing the contract space based on issue interdependencies. In: Proceedings of the 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology-Volume 02, WI-IAT’10, pp. 399–406. IEEE Computer Society, Washington, DC, USA (2010)
Hadfi, R., Ito, T.: Cognition as a game of complexity. In: Proceedings of 12th International Conference on Cognitive Modeling (ICCM) (2013)
Hadfi, R., Ito, T.: Uncertainty of cognitive processes with high-information load. Procedia Soc. Behav. Sci. 97(0), 612–619 (2013). The 9th International Conference on Cognitive Science
Ito, T., Hattori, H., Klein, M.: Multi-issue negotiation protocol for agents: exploring nonlinear utility spaces. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-2007), pp. 1347–1352 (2007)
Kwisthout, J., van Rooij, I.: Bridging the gap between theory and practice of approximate bayesian inference. Cogn. Syst. Res. 24(0), 2–8 (2013). Cognitive Systems Research: Special Issue on ICCM2012
Lin, R., Kraus, S., Wilkenfeld, J., Barry, J.: Negotiating with bounded rational agents in environments with incomplete information using an automated agent. Artif. Intell. 172(6–7), 823–851 (2008)
Lopez-Carmona, M.A., Marsa-Maestre, I., De La Hoz, E., Velasco, J.R.: A region-based multi-issue negotiation protocol for nonmonotonic utility spaces. Comput. Intell. 27(2), 166–217 (2011)
Marsa-Maestre, I., Lopez-Carmona, M.A., Velasco, J.R., de la Hoz, E.: Effective bidding and deal identification for negotiations in highly nonlinear scenarios. In: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems-Volume 2, AAMAS’09, pp. 1057–1064. International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC (2009)
Marsa-Maestre, I., Lopez-Carmona, M.A., Carral, J.A., Ibanez, G.: A recursive protocol for negotiating contracts under non-monotonic preference structures. Group Decis. Negot. 22(1), 1–43 (2013)
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (1988)
Robu, V., Somefun, D.J.A., La Poutre, J.A.: Modeling complex multi-issue negotiations using utility graphs. In: Proceedings of the 4th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2005), pp. 280–287 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Hadfi, R., Ito, T. (2016). On the Complexity of Utility Hypergraphs. In: Fukuta, N., Ito, T., Zhang, M., Fujita, K., Robu, V. (eds) Recent Advances in Agent-based Complex Automated Negotiation. Studies in Computational Intelligence, vol 638. Springer, Cham. https://doi.org/10.1007/978-3-319-30307-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-30307-9_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-30305-5
Online ISBN: 978-3-319-30307-9
eBook Packages: EngineeringEngineering (R0)