Related papers: Disentangling Revealed Preference From Rationaliza…
There is an extensive literature in social choice theory studying the consequences of weakening the assumptions of Arrow's Impossibility Theorem. Much of this literature suggests that there is no escape from Arrow-style impossibility…
The rigid relation principle, introduced in this article, asserts that every set admits a rigid binary relation. This follows from the axiom of choice, because well-orders are rigid, but we prove that it is neither equivalent to the axiom…
The work reported here introduces Defeasible Logic Programming (DeLP), a formalism that combines results of Logic Programming and Defeasible Argumentation. DeLP provides the possibility of representing information in the form of weak rules…
Preference-based argumentation frameworks (PAFs) extend Dung's approach to abstract argumentation (AAFs) by encoding preferences over arguments. Such preferences control the transformation of attacks into defeats, and different approaches…
This paper maps out the relation between different approaches for handling preferences in argumentation with strict rules and defeasible assumptions by offering translations between them. The systems we compare are: non-prioritized defeats…
Nontransitive choices have long been an area of curiosity within economics. However, determining whether nontransitive choices represent an individual's preference is a difficult task since choice data is inherently stochastic. This paper…
Given a data-set of consumer behaviour, the Revealed Preference Graph succinctly encodes inferred relative preferences between observed outcomes as a directed graph. Not all graphs can be constructed as revealed preference graphs when the…
Consider the object allocation (one-sided matching) model of Shapley and Scarf (1974). When final allocations are observed but agents' preferences are unknown, when might the allocation be in the core? This is a one-sided analogue of the…
We consider methods for aggregating preferences that are based on the resolution of discrete optimization problems. The preferences are represented by arbitrary binary relations (possibly weighted) or incomplete paired comparison matrices.…
We design and implement lab experiments to evaluate the normative appeal of behavior arising from models of ambiguity-averse preferences. We report two main empirical findings. First, we demonstrate that behavior reflects an incomplete…
We provide an axiomatic characterization of lexicographic preferences over the set of all random availability functions using two assumptions. The first assumption is strong monotonicity, which in our framework is equivalent to the strong…
We study three axioms in the model of constrained social choice under uncertainty where (i) agents have subjective expected utility preferences over acts and (ii) different states of nature have (possibly) different sets of available…
We investigate joint probabilistic choice rules describing the behavior of two decision makers, each facing potentially distinct menus. These rules are separable when they can be decomposed into individual choices correlated solely through…
Quite recently, a new property related to norm-attaining operators has been introduced: the weak maximizing property (WMP). In this note, we define a generalised version of it considering other topologies than the weak one (mainly the…
Recently, it has been emphasized that the possibility theory framework allows us to distinguish between i) what is possible because it is not ruled out by the available knowledge, and ii) what is possible for sure. This distinction may be…
This paper introduces the axiom of Negative Dominance, stating that if a lottery $f$ is strictly preferred to a lottery $g$, then some outcome in the support of $f$ is strictly preferred to some outcome in the support of $g$. It is shown…
Incomplete preferences provide the epistemic foundation for models of imprecise subjective probabilities and utilities that are used in robust Bayesian analysis and in theories of bounded rationality. This paper presents a simple…
An important -- but very demanding -- property in collective decision-making is strategyproofness, which requires that voters cannot benefit from submitting insincere preferences. Gibbard (1977) has shown that only rather unattractive rules…
We study the computational complexity of explaining preference data through Boolean attribute models (BAMs), motivated by extensive research involving attribute models and their promise in understanding preference structure and enabling…
In some preference aggregation scenarios, voters' preferences are highly structured: e.g., the set of candidates may have one-dimensional structure (so that voters' preferences are single-peaked) or be described by a binary decision tree…