|
|
|
| Aggregation of Satisfactory Rankings for CP-Nets Based on Voting System |
| SUN Xue-Jiao,LIU Jing-Lei |
| School of Computer Science,Yantai University,Yantai 264005 |
|
|
|
|
Abstract The satisfactory ranking for conditional preference networks (CP-Nets) is a ranking of all outcomes acquired from preferences of decision maker,and its preference relation is incomplete and transitive. The feasibility on aggregation of satisfactory rankings for CP-Nets with traditional voting system is analyzed. The detailed realizations and performance analysis on aggregation of satisfactory rankings with the majority rule and positional voting are individually introduced. So it realizes the promotion and application of voting system from completeness to non-completeness.
|
|
Received: 25 October 2012
|
|
|
|
|
|
[1] Boutilier C.A POMDP Formulation of Preference Elicitation Problems // Proc of the 18th National Conference on Artificial Intelligence. Edmonton,Canada,2002: 239-246
[2] Braziunas D,Boutilier C. Local Utility Elicitation in GAI Models // Proc of the 21st Conference on Uncertainty in Artificial Intelligence(UAI). Edinburgh,UK,2005: 42-49
[3] Cramton P,Shoham Y,Steinberg R. Combinatorial Auctions. Combridge,USA: MIT Press,2006
[4] Conitzer V,Sandholm T. Vote Elicitation: Complexity and Strategy-Proofness // Proc of the 18th National Conference on Artificial Intelligence. Edmonton,Canada,2002: 392-397
[5] Escoffier B,Lang J,ztürk M. Single-Peaked Consistency and Its Complexity // Proc of the 18th European Conference on Artificial Intelligence. Amsterdam,The Netherlands,2008: 366-370
[6] Rossi F,Venable K B,Walsh T. mCP-Nets: Representing and Reasoning with Preferences of Multiple Agents // Proc of the 19th National Conference on Artificial Intelligence. San Jose,USA,2004: 729-734
[7] Xia Lirong,Conitzer V,Lang J. Aggregating Preferences in Multi-Issue Domains by Using Maximum Likelihood Estimators // Proc of 9th International Conference on Autonomous Agents and Multiagent Systems. Toronto,Canada,2010: 399-408
[8] Purrington K,Durfee E H. Agreeing on Social Outcomes Using Individual CP-Nets. Multiagent and Grid Systems,2009,5(4): 409-425
[9] Liu Zhaowei. Operations on Aggregation of Multiple CP-Nets. International Journal of Digital Content Technology and Its Applications,2012,4(8): 215-222
[10] Sun Xuejiao,Liu Jinglei. On the Satisfiability and Consistency for CP-Nets. Journal of Computer Research and Development,2012,49(4):754-762 (in Chinese)
(孙雪姣,刘惊雷. CP-Nets的可满足性及一致性研究.计算机研究与发展,2012,49(4): 754-762)
[11] Liu Jinglei. Research on CP-Nets and Its Expressive Power. Acta Automatica Sinica,2011,37(3): 290-302 (in Chinese)
(刘惊雷.CP-Nets及其表达能力研究.自动化学报,2011,37(3): 290-302)
[12] Easley D,Kleinberg J. Networks,Crowds,and Markets: Reasoning about a Highly Connected World. Cambridge,UK: Cambridge University Press,2010: 650-680
[13] Arrow K J. A Difficulty in the Concept of Social Welfare. Journal of Political Economy,1950,58 (4): 328-346
[14] Boutilier C,Brafman R,Domshlak C,et al. CP-Nets: A Tool for Representing and Reasoning with Conditional Ceteris Paribus Preference Statements. Journal of Artificial Intelligence Research,2004,21(1): 135-191 |
|
|
|
2013, Vol. 26 
