Low-complexity exploration in utility hypergraphs

Rafik Hadfi, Takayuki Ito

Research output: Contribution to journalArticleResearch

3 Citations (Scopus)


A novel representation for nonlinear utility spaces is provided, by adopting a modular decomposition of the issues and the constraints. The idea is 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. Exploring the utility space is therefore reduced 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. Particularly, we use a power-law heuristic that lowers the search cost when exploring the utility hypergraph. 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. The complexity of the generated utility spaces is evaluated using the information theoretic notion of entropy. The optimal search strategy allows a better scaling of the model for complex utility spaces.

Original languageEnglish
Pages (from-to)176-184
Number of pages9
JournalJournal of Information Processing
Issue number2
Publication statusPublished - 1 Jan 2015
Externally publishedYes


  • Entropy
  • Hyper-graph
  • Interdependent issues
  • Max-Sum
  • Nonlinear utility

Cite this