-
- Hadfi Rafik
- Department of Computer Science and Engineering, Nagoya Institute of Technology
-
- Ito Takayuki
- Department of Computer Science and Engineering, Nagoya Institute of Technology
この論文をさがす
抄録
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.
収録刊行物
-
- Journal of Information Processing
-
Journal of Information Processing 23 (2), 176-184, 2015
一般社団法人 情報処理学会
- Tweet
詳細情報
-
- CRID
- 1390001205294608128
-
- NII論文ID
- 130004952416
-
- NII書誌ID
- AA00700121
-
- ISSN
- 18826652
-
- 本文言語コード
- en
-
- データソース種別
-
- JaLC
- IRDB
- Crossref
- CiNii Articles
- KAKEN
-
- 抄録ライセンスフラグ
- 使用不可