Skip to main content

Utility Estimation in Large Preference Graphs Using A* Search

  • Conference paper
Advances in Artificial Intelligence (Canadian AI 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6657))

Included in the following conference series:

  • 1569 Accesses

Abstract

Existing preference prediction techniques can require that an entire preference structure be constructed for a user. These structures, such as Conditional Outcome Preference Networks (COP-nets), can grow exponentially in the number of attributes describing the outcomes. In this paper, a new approach for constructing COP-nets, using A* search, is introduced. Using this approach, partial COP-nets can be constructed on demand instead of generating the entire structure. Experimental results show that the new method yields enormous savings in time and memory requirements, with only a modest reduction in prediction accuracy.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H.H., Poole, D.: CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements. Journal of Artificial Intelligence Research 21, 135–191 (2004)

    MATH  Google Scholar 

  2. Boutilier, C., Patrascu, R., Poupart, P., Schuurmans, D.: Regret-based utility elicitation in constraint-based decision problems. In: Proceedings of IJCAI 2005, Edinburgh, Scotland, pp. 929–934 (2005)

    Google Scholar 

  3. Chajewska, U., Koller, D., Parr, R.: Making rational decisions using adaptive utility elicitation. In: AAAI 2000, Austin, Texas, USA, pp. 363–369 (2000)

    Google Scholar 

  4. Chen, S.: Reasoning with conditional preferences across attributes. Master’s thesis, University of New Brunswick (2006)

    Google Scholar 

  5. Chen, S., Buffett, S., Fleming, M.W.: Reasoning with conditional preferences across attributes. In: Proc. of AI 2007, Montreal, Canada, pp. 369–380 (2007)

    Google Scholar 

  6. Faratin, P., Sierra, C., Jennings, N.R.: Using similarity criteria to make issue trade-offs in automated negotiations. Artificial Intelligence 142, 205–237 (2002)

    Article  Google Scholar 

  7. Fatima, S.S., Wooldridge, M., Jennings, N.R.: Optimal negotiation of multiple issues in incomplete information settings. In: Proc. 3rd Int. Conf. on Autonomous Agents and Multi-Agent Systems, New York, NY, pp. 1080–1087 (2004)

    Google Scholar 

  8. Jennings, N.R., Faratin, P., Lomuscio, A., Parsons, S., Sierra, C., Wooldridge, M.: Automated negotiation: prospects, methods and challenges. Int. J. of Group Decision and Negotiation 10(2), 199–215 (2001)

    Article  Google Scholar 

  9. Keeney, R.L., Raiffa, H.: Decisions with Multiple Objectives: Preferences and Value Tradeoffs. John Wiley and Sons, Inc., Chichester (1976)

    MATH  Google Scholar 

  10. Sandholm, T., Boutilier, C.: Preference elicitation in combinatorial auctions. In: Cramton, P., Shoham, Y., Steinberg, R. (eds.) Combinatorial Auctions (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Her Majesty the Queen in Right of Canada

About this paper

Cite this paper

Bediako-Asare, H., Buffett, S., Fleming, M.W. (2011). Utility Estimation in Large Preference Graphs Using A* Search. In: Butz, C., Lingras, P. (eds) Advances in Artificial Intelligence. Canadian AI 2011. Lecture Notes in Computer Science(), vol 6657. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21043-3_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21043-3_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21042-6

  • Online ISBN: 978-3-642-21043-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics