Skip to main content
SpringerLink
Log in

On the Complexity of Utility Hypergraphs

  • Chapter
  • First Online:
Recent Advances in Agent-based Complex Automated Negotiation

Part of the book series: Studies in Computational Intelligence ((SCI,volume 638))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. 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)

    Google Scholar 

  2. 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)

    Google Scholar 

  3. 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)

    Google Scholar 

  4. 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)

    Google Scholar 

  5. Hadfi, R., Ito, T.: Cognition as a game of complexity. In: Proceedings of 12th International Conference on Cognitive Modeling (ICCM) (2013)

    Google Scholar 

  6. 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

    Google Scholar 

  7. 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)

    Google Scholar 

  8. 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

    Google Scholar 

  9. 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)

    Article  MathSciNet  MATH  Google Scholar 

  10. 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)

    Article  MathSciNet  MATH  Google Scholar 

  11. 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)

    Google Scholar 

  12. 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)

    Article  Google Scholar 

  13. Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (1988)

    MATH  Google Scholar 

  14. 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Graduate School of Engineering, Nagoya Institute of Technology, Gokiso, Showa-ku, Nagoya, 466-8555, Japan

    Rafik Hadfi & Takayuki Ito

Authors
  1. Rafik Hadfi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Takayuki Ito
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rafik Hadfi .

Editor information

Editors and Affiliations

  1. Hamamatsu, Shizuoka, Japan

    Naoki Fukuta

  2. Nagoya Institute of Technology, Nagoya, Japan

    Takayuki Ito

  3. School of Computer Science, University of Wollongong, Wollongong, New South Wales, Australia

    Minjie Zhang

  4. Tokyo University of Agriculture and, Tokyo, Japan

    Katsuhide Fujita

  5. Institute of Sensors, Signals, Heriot-Watt University, Riccarton, United Kingdom

    Valentin Robu

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation