Abstract
The increasing popularity of graphs as fundamental data structures, due to their inherent flexibility in modeling information and its structure, has led to the development of methods to efficiently store, search and query graphs. Graphs are nonetheless complex entities whose analysis is cognitively challenging. This calls for the development of decision support systems that build upon a measure of ‘usefulness’ of graphs. We address this problem by introducing and defining the concept of ‘graph utility’. As the direct specification of utility functions is itself a difficult problem, we explore the problem of learning utility functions for graphs on the basis of user preferences that are extracted from pairwise graph comparisons.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bous, G., Fortemps, Ph., Glineur, F., Pirlot,M.: ACUTA: A novel method for eliciting additive value functions on the basis of holistic preference statements. EJOR 206, 435–444 (2010)
Fishburn, P.C.: Utility Theory for Decision Making. Wiley, New York (1970)
Greco, S.,Mousseau, V., Słowi´nski, R.: Ordinal regression revisited: multiple criteria ranking using a set of additive value functions. EJOR 191, 415–435 (2008)
Huard, P.: Resolution of mathematical programming with nonlinear constraints by the method of centers. In: Abadie, J. (ed.) Nonlinear Programming, pp. 209–219.Wiley, New York (1967)
Jacquet-Lagr`eze, E., Siskos, Y.: Assessing a set of additive utility functions to multicriteria decision-making: the UTA method. EJOR 10, 151–164 (1982)
Keeney, R.L., Raiffa, H.: Decisions with multiple objectives: Preferences and value tradeoffs. Wiley, New York (1976)
Nesterov, Y.E., Nemirovskii, A.S.: Interior-point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia (1994)
Siskos, Y., Grigoroudis, E., Matsatsinis, N.: UTA Methods. In: Figueira, J., Greco, S., Ehrgott, M. (eds.) Multiple Criteria Decision Analysis: State of the Art Surveys, pp. 297–334. Springer, New York (2005)
Sonnevend, G.: An analytical centre for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming. In: Prekopa, A., Szelezsan, J., Strazicky, B. (eds.) LNCIS, pp. 866–876. Springer, Heidelberg (1985)
Ye, Y.: Interior Point Algorithms: Theory and Analysis. Wiley, New York (1997)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bous, G. (2012). Learning utility functions from preference relations on graphs. In: Klatte, D., Lüthi, HJ., Schmedders, K. (eds) Operations Research Proceedings 2011. Operations Research Proceedings. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29210-1_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-29210-1_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29209-5
Online ISBN: 978-3-642-29210-1
eBook Packages: Business and EconomicsBusiness and Management (R0)