eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2006-01-19
4271
1
17
10.4230/DagSemProc.04271.1
article
04271 Abstracts Collection – Preferences: Specification, Inference, Applications
Bosi, Gianni
Brafman, Ronen I.
Chomicki, Jan
Kießling, Werner
From 27.06.04 to 02.07.04, the Dagstuhl Seminar 04271 ``Preferences: Specification, Inference, Applications'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol04271/DagSemProc.04271.1/DagSemProc.04271.1.pdf
Preference specification and representation
preference composition and merging
preference aggregation
xiomatic properties of preferences
logics of preference
topological/algebraic preference structures and their utility representation
inear and non-linear utility representations
preferences with intransitive indifference
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2006-01-19
4271
1
6
10.4230/DagSemProc.04271.2
article
Adaptive Rich Media Presentations via Preference-Based Constrained Optimization
Brafman, Ronen I.
Friedman, Doron
Personalization and adaptation of multi-media messages are well
known and well studied problems. Ideally, each message should reflect
its recipient's interests, device capabilities, and network
conditions. Such personalization is more difficult to carry out
given a compound multi-media presentation containing multiple
spatially and temporally related elements. This paper describes a novel
formal, yet practical approach, and
an implemented system prototype for authoring and adapting compound multi-media presentations. Our approach builds on recent advances in preference specification and preferences-based constrained optimization techniques.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol04271/DagSemProc.04271.2/DagSemProc.04271.2.pdf
Preferences
cp-nets
multi-media presentations
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2006-01-19
4271
1
1
10.4230/DagSemProc.04271.3
article
Efficient Evaluation of Numerical Preferences: Top k Queries, Skylines and Multi-objective Retrieval
Balke, Wolf-Tilo
Query processing in databases and information systems has developed beyond mere SQL-style exact matching of attribute values. Scoring database objects according to numerical user preferences and retrieving only the top k matches or Pareto-optimal result sets (skyline queries) are already common for a variety of applications.
Recently a lot of database literature has focussed on how to efficiently evaluate queries based on numerical preferences. Specialized algorithms using either top k retrieval (assuming a single compensation function defined over all query predicates, i.e. a global utility function) or computing skylines (assuming all query predicates as pairwise incomparable) have been shown to be capable of avoiding naïve linear database scans by pruning large numbers of database objects and thus vastly improve scalability. However, both paradigms are only two extreme cases of exploring viable compromises for each user’s objectives, which may or may not be comparable. To find the correct result set for arbitrary cases of multi-objective query processing in databases a novel algorithm for computing sets of objects that are non-dominated with respect to a set of monotonic objective functions representing a user's notion of utility, has recently been presented. Naturally containing top k and skyline retrieval paradigms as special cases, this algorithm maintains scalability also for all cases in between. To be more precise, in both special cases the multi-objective retrieval algorithm will behave exactly like the most efficient known evaluation algorithms for top k and skyline queries respectively. This algorithm has also been proved to be correct and instance-optimal in terms of necessary object accesses. Moreover, it improves the psychological response behavior by progressively producing result objects as quickly as possible, while the algorithm is still running, so user can deal with result objects at the earliest point in time.
Our tutorial will discuss all state of the art algorithms for top k retrieval, skyline queries and multi-objective retrieval and point to open problems, future extensions of the paradigm and research in numerical preferences.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol04271/DagSemProc.04271.3/DagSemProc.04271.3.pdf
Top k retrieval
skyline queries
multi-objective optimization
numerical preferences
utility functions
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2006-01-19
4271
1
9
10.4230/DagSemProc.04271.4
article
Non-Transitive Consumer Behavior
Fuchs-Seliger, Susanne
Rational choice when preferences are not required to be transitive and complete has been discussed in the literature for years. In this article transitivity and completeness of the preference relation is also not assumed. It will be shown that nevertheless the existence of a competitive equilibrium can be proven when those properties are replaced by a domination property which allows that there could be cicles among those alternatives which are of less importance for the individual and which he or she would never choose if better ones are available.
Moreover, one can show that the compensated demand function is continuous under very weak conditions, and because of this, Shephard’s lemma follows without assuming transitivity and completeness of the underlying preferences.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol04271/DagSemProc.04271.4/DagSemProc.04271.4.pdf
Rational choice
consumer behavior
competitive equilibrium
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2006-01-19
4271
1
19
10.4230/DagSemProc.04271.5
article
Personalization of Queries based on User Preferences
Koutrika, Georgia
Ioannidis, Yannis
Query Personalization is the process of dynamically enhancing a query with related user preferences stored in a user profile with the aim of providing personalized answers. The underlying idea is that different users may find different things relevant to a search due to different preferences. Essential ingredients of query personalization are: (a) a model for representing and storing preferences in user profiles, and (b) algorithms for the generation of personalized answers using stored preferences. Modeling the plethora of preference types is a challenge. In this paper, we present a preference model that combines expressivity and concision. In addition, we provide algorithms for the selection of preferences related to a query and the progressive generation of personalized results, which are ranked based on user interest.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol04271/DagSemProc.04271.5/DagSemProc.04271.5.pdf
Query personalization
user profiles
preferences
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2006-01-19
4271
0
0
10.4230/DagSemProc.04271.6
article
Preference Modelling
Öztürk, Meltem
Tsoukias, Alexis
Vincke, Philippe
This paper provides the reader with a presentation of preference modelling fundamental notions as well as some recent results in this field. Preference modelling is an inevitable step in a variety of fields: economy, sociology, psychology, mathematical programming, even medicine, archaeology, and obviously decision analysis. Our notation and some basic definitions, such as those of binary relation, properties and ordered sets, are presented at the beginning of the paper. We start by discussing different reasons for constructing a model or preference. We then go through a number of issues that influence the construction of preference models. Different formalisations besides classical
logic such as fuzzy sets and non-classical logics become necessary. We then present different types of preference structures reflecting the behavior of a decision-maker: classical, extended and valued ones. It is relevant to have a numerical representation of preferences: functional representations,
value functions. The concepts of thresholds and minimal representation are also introduced in this section. In section 7, we briefly explore the concept of deontic logic (logic of preference) and other formalisms associated with "compact representation of preferences" introduced for special purpoes. We end the paper with some concluding remarks.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol04271/DagSemProc.04271.6/DagSemProc.04271.6.pdf
Preferences
Interval Orders
Hesitation
Logical formulation
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2006-01-19
4271
1
20
10.4230/DagSemProc.04271.7
article
Preference-based Problem Solving for Constraint Programming
Junker, Ulrich
Combinatorial problems such as scheduling, resource allocation, and configuration have many
attributes that can be subject of user preferences. Traditional optimization approaches compile
those preferences into a single utility function and use it as the optimization objective when
solving the problem, but neither explain why the resulting solution satisfies the original
preferences, nor indicate the trade-offs made during problem solving. We argue that the
whole problem solving process becomes more transparent and controllable for the user
if it is based on the original preferences. We show how the original preferences can be used
to control the problem solving process and how they can be used to explain the choice
and the optimality of the detected solution. Based on this explanation, the user can refine
the preference model, thus gaining full control over the problem solver.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol04271/DagSemProc.04271.7/DagSemProc.04271.7.pdf
Multi-criteria optimization
preferences
explanations
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2006-01-19
4271
1
6
10.4230/DagSemProc.04271.8
article
Preferences on Intervals: a general framework
Tsoukias, Alexis
Öztürk, Meltem
I present a general framework for the comparison of alternatives to which (possibly) an interval of values is associated. Some representation theorems for the existence of the intervals are discussed as well the possibility ot explicitly take into account situations of hesitation.
Some appropriate logical formalisms are discussed for such a purpose.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol04271/DagSemProc.04271.8/DagSemProc.04271.8.pdf
Preferences
Interval Orders
Hesitation
Logical formulation
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2006-01-19
4271
1
9
10.4230/DagSemProc.04271.9
article
Representing preferences in the possibilistic setting
Souhila Kaci
Dubois, Didier
Prade, Henri
The accurate and easy representation of users' preferences in information
engineering systems becomes an important issue. Possibility theory provides a
generic framework for the qualitative representation of preferences, where
several equivalent information formats co- exist (distribution, logical bases,
conditionals, graphical networks). Moreover, a bipolar representation
distinguishing between positive and negative preferences has been developed in
this setting. The paper offers a comprehensive survey of these representation
issues.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol04271/DagSemProc.04271.9/DagSemProc.04271.9.pdf
Possibility
preference
possibilistic logic