English
Related papers

Related papers: Monotonic and Nonmonotonic Preference Revision

200 papers

We develop a new class of spatial voting models for binary preference data that can accommodate both monotonic and non-monotonic response functions, and are more flexible than alternative "unfolding" models previously introduced in the…

Applications · Statistics 2025-01-01 Rayleigh Lei , Abel Rodriguez

We propose and develop an algebraic approach to revealed preference. Our approach dispenses with non algebraic structure, such as topological assumptions. We provide algebraic axioms of revealed preference that subsume previous, classical…

Theoretical Economics · Economics 2021-06-01 Mikhail Freer , Cesar Martinelli

In this paper we describe a novel a procedure to build a linear order from an arbitrary poset which (i) preserves the original ordering and (ii) allows to extend monotonic and antitonic mappings defined over the original poset to monotonic…

Discrete Mathematics · Computer Science 2010-06-15 Nicolas Madrid Labrador , Umberto Straccia

Bilattice-based triangle provides an elegant algebraic structure for reasoning with vague and uncertain information. But the truth and knowledge ordering of intervals in bilattice-based triangle can not handle repetitive belief revisions…

Artificial Intelligence · Computer Science 2020-11-24 Kumar Sankar Ray , Sandip Paul , Diganta Saha

In this paper we study several monotonicity axioms in approval-based multi-winner voting rules. We consider monotonicity with respect to the support received by the winners and also monotonicity in the size of the committee. Monotonicity…

Computer Science and Game Theory · Computer Science 2019-02-25 Luis Sánchez-Fernández , Jesús A. Fisteus

We extend well-known comparative results under expected utility to models of non-expected utility by providing novel conditions on local utility functions. We illustrate how our results parallel, and are distinct from, existing results for…

Theoretical Economics · Economics 2026-01-16 Collin Raymond , Yangwei Song

This paper is dedicated to a cautious learning methodology for predicting preferences between alternatives characterized by binary attributes (formally, each alternative is seen as a subset of attributes). By "cautious", we mean that the…

Artificial Intelligence · Computer Science 2022-06-16 Hugo Gilbert , Mohamed Ouaguenouni , Meltem Ozturk , Olivier Spanjaard

To resolve conflicts among norms, various nonmonotonic formalisms can be used to perform prioritized normative reasoning. Meanwhile, formal argumentation provides a way to represent nonmonotonic logics. In this paper, we propose a…

Artificial Intelligence · Computer Science 2018-03-06 Beishui Liao , Nir Oren , Leendert van der Torre , Serena Villata

This paper studies axioms for nonmonotonic consequences from a semantics-based point of view, focusing on a class of mathematical structures for reasoning about partial information without a predefined syntax/logic. This structure is called…

Logic in Computer Science · Computer Science 2007-05-23 Guo-Qiang Zhang

In this paper, we present a link between preference-based and multiobjective sequential decision-making. While transforming a multiobjective problem to a preference-based one is quite natural, the other direction is a bit less obvious. We…

Artificial Intelligence · Computer Science 2017-01-04 Paul Weng

Literature involving preferences of artificial agents or human beings often assume their preferences can be represented using a complete transitive binary relation. Much has been written however on different models of preferences. We review…

Artificial Intelligence · Computer Science 2018-01-17 Olivier Cailloux , Sébastien Destercke

Proportional ranking rules aggregate approval-style preferences of agents into a collective ranking such that groups of agents with similar preferences are adequately represented. Motivated by the application of live Q&A platforms, where…

Computer Science and Game Theory · Computer Science 2021-05-18 Jonas Israel , Markus Brill

Argumentation is a non-monotonic process. This reflects the fact that argumentation involves uncertain information, and so new information can cause a change in the conclusions drawn. However, the base logic does not need to be…

Artificial Intelligence · Computer Science 2018-09-05 Anthony Hunter

The ability to uncover preferences from choices is fundamental for both positive economics and welfare analysis. Overwhelming evidence shows that choice is stochastic, which has given rise to random utility models as the dominant paradigm…

General Economics · Economics 2018-11-07 Carlos Alos-Ferrer , Ernst Fehr , Nick Netzer

Repair-based semantics have been extensively studied as a means of obtaining meaningful answers to queries posed over inconsistent knowledge bases (KBs). While several works have considered how to exploit a priority relation between facts…

Logic in Computer Science · Computer Science 2025-11-25 Meghyn Bienvenu , Camille Bourgaux , Katsumi Inoue , Robin Jean

We consider different choice procedures such as scoring rules, rules, using majority relation, value function and tournament matrix, which are used in social and multi-criteria choice problems. We focus on the study of the properties that…

Optimization and Control · Mathematics 2016-11-03 Sergey Shvydun

A consistent query answer in an inconsistent database is an answer obtained in every (minimal) repair. The repairs are obtained by resolving all conflicts in all possible ways. Often, however, the user is able to provide a preference on how…

Databases · Computer Science 2011-10-10 Slawomir Staworko , Jan Chomicki , Jerzy Marcinkowski

We investigate properties of ABA+, a formalism that extends the well studied structured argumentation formalism Assumption-Based Argumentation (ABA) with a preference handling mechanism. In particular, we establish desirable properties that…

Artificial Intelligence · Computer Science 2017-11-07 Kristijonas Cyras , Francesca Toni

We discuss conditionalisation for Accept-Desirability models in an abstract decision-making framework, where uncertain rewards live in a general linear space, and events are special projection operators on that linear space. This abstract…

Artificial Intelligence · Computer Science 2025-12-23 Kathelijne Coussement , Gert de Cooman , Keano De Vos

We consider entailment problems involving powerful constraint languages such as frontier-guarded existential rules in which we impose additional semantic restrictions on a set of distinguished relations. We consider restricting a relation…

Logic in Computer Science · Computer Science 2022-02-18 Antoine Amarilli , Michael Benedikt , Pierre Bourhis , Michael Vanden Boom