LowComplexity Exploration in Utility Hypergraphs LowComplexity Exploration in Utility Hypergraphs
Access this Article
Search this Article
Author(s)
Abstract
A novel representation for nonlinear utility spaces is provided, by adopting a modular decomposition of the issues and the constraints. The idea is that constraintbased 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 issueconstraint 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 MaxSum algorithm. Particularly, we use a powerlaw 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.A novel representation for nonlinear utility spaces is provided, by adopting a modular decomposition of the issues and the constraints. The idea is that constraintbased 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 issueconstraint 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 MaxSum algorithm. Particularly, we use a powerlaw 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.
Journal

 Journal of information processing

Journal of information processing 23(2), 176184, 20150315
Information Processing Society of Japan