Consensus with Heterogeneous Preference Representation Structures

2015 ◽  
pp. 127-171
Author(s):  
Yucheng Dong ◽  
Jiuping Xu
Keyword(s):  
Preference Representation ◽  
Heterogeneous Preference

scholarly journals A geometrical method for consensus building in GDM with incomplete heterogeneous preference information

2021 ◽  
Vol 105 ◽  
pp. 107224
Author(s):  
Gang Kou ◽  
Yi Peng ◽  
Xiangrui Chao ◽  
Enrique Herrera-Viedma ◽  
Fawaz E. Alsaadi
Keyword(s):  
Consensus Building ◽  
Geometrical Method ◽  
Preference Information ◽  
Heterogeneous Preference

Compact Preference Representation for Boolean Games

2006 ◽  
pp. 41-50 ◽  
Author(s):  
Elise Bonzon ◽  
Marie-Christine Lagasquie-Schiex ◽  
Jérôme Lang
Keyword(s):  
Preference Representation ◽  
Boolean Games

Personalisation in Highly Dynamic Grid Services Environments

2009 ◽  
pp. 284-313
Author(s):  
Edgar Jembere ◽  
Matthew O. Adigun ◽  
Sibusiso S. Xulu
Keyword(s):  
User Preferences ◽  
User Preference ◽  
Grid Services ◽  
Context Aware Computing ◽  
Preference Representation ◽  
Use Of Services ◽  
Order Preference ◽  
Computing Environments ◽  
Preference Models ◽  
Intuitive Interpretation

Human Computer Interaction (HCI) challenges in highly dynamic computing environments can be solved by tailoring the access and use of services to user preferences. In this era of emerging standards for open and collaborative computing environments, the major challenge that is being addressed in this chapter is how personalisation information can be managed in order to support cross-service personalisation. The authors’ investigation of state of the art work in personalisation and context-aware computing found that user preferences are assumed to be static across different context descriptions whilst in reality some user preferences are transient and vary with changes in context. Further more, the assumed preference models do not give an intuitive interpretation of a preference and lack user expressiveness. This chapter presents a user preference model for dynamic computing environments, based on an intuitive quantitative preference measure and a strict partial order preference representation, to address these issues. The authors present an approach for mining context-based user preferences and its evaluation in a synthetic m-commerce environment. This chapter also shows how the data needed for mining context-based preferences is gathered and managed in a Grid infrastructure for mobile devices.

Learning-Based Preference Modeling in Engineering Design Decision-Making

1999 ◽  
Vol 123 (2) ◽  
pp. 191-198 ◽  
Author(s):  
Jie Wan ◽  
Sundar Krishnamurty
Keyword(s):  
Engineering Design ◽  
Deductive Reasoning ◽  
Integrated Approach ◽  
Design Decision ◽  
Learning Method ◽  
Preference Modeling ◽  
Modeling Process ◽  
Preference Representation ◽  
Elicitation Process ◽  
Effective Integration

Focusing on the efforts towards a consistent preference representation in decision based engineering design, this paper presents a learning-based comparison and preference modeling process. Through effective integration of a deductive reasoning-based on designer’s outcome ranking in a lottery questions-based elicitation process, this work offers a reliable framework for formulating utility functions that reflect designer’s priorities accurately and consistently. It is expected that this integrated approach will reduce designer’s cognitive burden, and lead to accurate and consistent preference representation. Salient features of this approach include a linear programming based dynamic preference learning method and a logical analysis of preference inconsistencies. The development of this method and its utilization in engineering design are presented in the context of a mechanism design problem and the results are discussed.

Preference Representation and the Limits of Reform: The 1976 Democratic Convention

1982 ◽  
Vol 44 (1) ◽  
pp. 201-211 ◽  
Author(s):  
David C. Paris ◽  
Richard D. Shingles
Keyword(s):  
Preference Representation

Rule-based formalism and preference representation: An extension of negoplan

1990 ◽  
Vol 45 (2-3) ◽  
pp. 309-323 ◽  
Author(s):  
Gregory E. Kersten ◽  
Stan Szpakowicz
Keyword(s):  
Rule Based ◽  
Preference Representation

AN ALGORITHMIC APPROACH TO PREFERENCE REPRESENTATION

2008 ◽  
Vol 16 (supp02) ◽  
pp. 1-18 ◽  
Author(s):  
J. YÁÑEZ ◽  
J. MONTERO ◽  
D. GÓMEZ
Keyword(s):  
Decision Makers ◽  
Dimension Theory ◽  
Preference Structure ◽  
General Representation ◽  
Algorithmic Approach ◽  
Strong Assumption ◽  
Preference Representation ◽  
Alternative Approach ◽  
Order Sets ◽  
The One

In a previous paper, the authors proposed an alternative approach to classical dimension theory, based upon a general representation of strict preferences not being restricted to partial order sets. Without any relevant restriction, the proposed approach was conceived as a potential powerful tool for decision making problems where basic information has been modeled by means of valued binary preference relations. In fact, assuming that each decision maker is able to consistently manage intensity values for preferences is a strong assumption even when there are few alternatives being involved (if the number of alternatives is large, the same criticism applies to crisp preferences). Any representation tool, as the one proposed by the authors, will in principle play a key role in order to help decision makers to understand their preference structure. In this paper we introduce an alternative approach in order to avoid certain complexity issues of the initial proposal, allowing a close representation easier to be obtained in practice.

Sign in / Sign up

Export Citation Format

Share Document