English
Related papers

Related papers: A characterization of lexicographic preferences

200 papers

Sentiment polarity classification is perhaps the most widely studied topic. It classifies an opinionated document as expressing a positive or negative opinion. In this paper, using movie review dataset, we perform a comparative study with…

Computation and Language · Computer Science 2013-11-05 Zitao Liu

Lower semi-continuity (\texttt{LSC}) is a critical assumption in many foundational optimisation theory results; however, in many cases, \texttt{LSC} is stronger than necessary. This has led to the introduction of numerous weaker continuity…

Optimization and Control · Mathematics 2025-04-11 Jacob Westerhout , Xin Guo , Hien Duy Nguyen

We describe a design principle for adaptive systems under which adaptation is driven by particular challenges that the environment poses, as opposed to average or otherwise aggregated measures of performance over many challenges. We trace…

Neural and Evolutionary Computing · Computer Science 2023-06-13 Lee Spector , Li Ding , Ryan Boldi

This paper deals with the problem of finding the preferred extensions of an argumentation framework by means of a bijection with the naive sets of another framework. First, we consider the case where an argumentation framework is…

Combinatorics · Mathematics 2023-06-19 Mohammed Elaroussi , Lhouari Nourine , Mohammed Said Radjef , Simon Vilmin

Learning the preferences of a human improves the quality of the interaction with the human. The number of queries available to learn preferences maybe limited especially when interacting with a human, and so active learning is a must. One…

Machine Learning · Computer Science 2020-02-18 Sriram Gopalakrishnan , Utkarsh Soni

Several resource allocation problems involve multiple types of resources, with a different agency being responsible for "locally" allocating the resources of each type, while a central planner wishes to provide a guarantee on the properties…

Computer Science and Game Theory · Computer Science 2021-02-23 Sujoy Sikdar , Xiaoxi Guo , Haibin Wang , Lirong Xia , Yongzhi Cao

The occurrence of unknown words in texts significantly hinders reading comprehension. To improve accessibility for specific target populations, computational modelling has been applied to identify complex words in texts and substitute them…

Computation and Language · Computer Science 2023-03-10 Kai North , Marcos Zampieri , Matthew Shardlow

Computational interpretations of linear logic allow static control of memory resources: the data produced by the program are endowed through its type with attributes that determine its life cycle, and guarantee safe deallocation. The use of…

Programming Languages · Computer Science 2025-10-09 Hector Gramaglia

We begin by formulating and characterizing a dominance criterion for prize sequences: $x$ dominates $y$ if any impatient agent prefers $x$ to $y$. With this in hand, we define a notion of comparative patience. Alice is more patient than Bob…

Theoretical Economics · Economics 2024-07-03 Mark Whitmeyer

Despite the potential impact of explanations on decision making, there is a lack of research on quantifying their effect on users' choices. This paper presents an experimental protocol for measuring the degree to which positively or…

Human-Computer Interaction · Computer Science 2023-03-17 Krisztian Balog , Filip Radlinski , Andrey Petrov

Completeness and transitivity are standard rationality conditions in economics. However, under ambiguity, decision makers sometimes violate these requirements because of the difficulty of forming accurate predictions about ambiguous events.…

Theoretical Economics · Economics 2025-09-16 Kensei Nakamura , Shohei Yanagita

We study the two-sided stable matching problem with one-sided uncertainty for two sets of agents A and B, with equal cardinality. Initially, the preference lists of the agents in A are given but the preferences of the agents in B are…

Data Structures and Algorithms · Computer Science 2024-07-16 Evripidis Bampis , Konstantinos Dogeas , Thomas Erlebach , Nicole Megow , Jens Schlöter , Amitabh Trehan

Feature selection can facilitate the learning of mixtures of discrete random variables as they arise, e.g. in crowdsourcing tasks. Intuitively, not all workers are equally reliable but, if the less reliable ones could be eliminated, then…

Machine Learning · Statistics 2017-11-28 Vincent Zhao , Steven W. Zucker

Language models (LMs) tend to show human-like preferences on a number of syntactic phenomena, but the extent to which these are attributable to direct exposure to the phenomena or more general properties of language is unclear. We explore…

Computation and Language · Computer Science 2025-08-12 Qing Yao , Kanishka Misra , Leonie Weissweiler , Kyle Mahowald

Self-preference is a fundamental feature of biological organisms. Since large language models (LLMs) lack sentience, they might be expected to avoid such distortions. Yet, across 72 experiments and ~41,000 queries, we discovered massive…

Artificial Intelligence · Computer Science 2026-05-20 Steven A. Lehr , Mary Cipperman , Mahzarin R. Banaji

The paper describes an extension of well-founded semantics for logic programs with two types of negation. In this extension information about preferences between rules can be expressed in the logical language and derived dynamically. This…

Artificial Intelligence · Computer Science 2008-02-03 G. Brewka

Inthispaperwedescribeaconcept-wisemulti-preferencesemantics for description logic which has its root in the preferential approach for modeling defeasible reasoning in knowledge representation. We argue that this proposal, beside satisfying…

Artificial Intelligence · Computer Science 2020-09-03 Laura Giordano , Valentina Gliozzi , Daniele Theseider Dupré

We give a semantics to iterated update by a preference relation on possible developments. An iterated update is a sequence of formulas, giving (incomplete) information about successive states of the world. A development is a sequence of…

Artificial Intelligence · Computer Science 2007-05-23 Shai Berger , Daniel Lehmann , Karl Schlechta

We study stable matchings that are robust to preference changes in the two-sided stable matching setting of Gale and Shapley [GS62]. Given two instances $A$ and $B$ on the same set of agents, a matching is said to be robust if it is stable…

Computer Science and Game Theory · Computer Science 2026-01-14 Rohith Reddy Gangam , Tung Mai , Nitya Raju , Vijay V. Vazirani

We study stable matching problems where agents have multilayer preferences: There are $\ell$ layers each consisting of one preference relation for each agent. Recently, Chen et al. [EC '18] studied such problems with strict preferences,…

Computer Science and Game Theory · Computer Science 2022-05-17 Matthias Bentert , Niclas Boehmer , Klaus Heeger , Tomohiro Koana
‹ Prev 1 8 9 10 Next ›