Multiple Criteria Sorting Problem consists in assigning a set of alternatives A"Ma 1 , a 2 ,2, l evaluated on n criteria g 1 , g 2 ,2, n to one of the categories which are pre-de"ned by some norms corresponding to vectors of scores on particular criteria, called pro"les, either separating the categories or playing the role of central reference objects in the categories. The assignment of an alt...

We propose an axiomatic framework for updating complete preference orderings without the monotonicity axiom. The induced preference reversals are justified on the basis of a normative interpretation that reconciles consequentialism with adequate forms of choice consistency. We conclude that preferences need not, and in some contexts even should not be recursive, thus confirming the intuition of...

Fukuda and Handa [7] asked whether every even partial cube G is harmonic-even. It is shown that the answer is positive if the isometric dimension of G equals its diameter which is in turn true for partial cubes with isometric dimension at most 6. Under an additional technical condition it is proved that an even partial cube G is harmonic-even or has two adjacent vertices whose diametrical verti...

In this paper we explore the relationship between “preference elicitation”, a learning-style problem that arises in combinatorial auctions, and the problem of learning via queries studied in computational learning theory. Preference elicitation is the process of asking questions about the preferences of bidders so as to best divide some set of goods. As a learning problem, it can be thought of ...

In this paper, we show that personalized levels can be automatically generated for platform games. We build on previous work, where models were derived that predicted player experience based on features of level design and on playing styles. These models are constructed using preference learning, based on questionnaires administered to players after playing different levels. The contributions o...

We propose a versatile framework for combining knowledge bases in modular systems with preferences. In our formalism, each module (knowledge base) can be specified in a different language. We define the notion of a preference-based modular system that includes a formalization of metapreferences. We prove that our formalism is robust in the sense that the operations for combining modules preserv...