English
Related papers

Related papers: Outer Diversity of Structured Domains

200 papers

A preferential arrangement of a finite set is an ordered partition. Associated with each such ordered partition is a chain of subsets or blocks endowed with a linear order. The chain may be split into sections by the introduction of a…

Combinatorics · Mathematics 2015-04-07 S. Nkonkobe , V. Murali

Single-peaked preferences and domains are extensively researched in social science and economics. In this study, we examine the interval property as well as combinatorial structure of single-peaked preferences on a fixed Left-Right social…

Combinatorics · Mathematics 2022-02-24 Ping Zhan

The success of software model checking depends on finding an appropriate abstraction of the subject program. The choice of the abstract domain and the analysis configuration is currently left to the user, who may not be familiar with the…

Software Engineering · Computer Science 2013-05-30 Sven Apel , Dirk Beyer , Karlheinz Friedberger , Franco Raimondi , Alexander von Rhein

A discussion about conditions on the profiles of voters in order to avoid contradictory decisions that have been designed by Sen and others.

History and Overview · Mathematics 2021-06-16 Labib Haddad

We introduce a novel choice dataset, called joint choice, in which options and menus are multidimensional. In this general setting, we define a notion of choice separability, which requires that selections from some dimensions are never…

Theoretical Economics · Economics 2025-09-09 Davide Carpentiere , Alfio Giarlotta , Angelo Petralia , Ester Sudano

We investigate the problem of deciding whether a given preference profile is close to having a certain nice structure, as for instance single-peaked, single-caved, single-crossing, value-restricted, best-restricted, worst-restricted,…

Computer Science and Game Theory · Computer Science 2015-09-16 Robert Bredereck , Jiehua Chen , Gerhard J. Woeginger

We consider a setting with agents that have preferences over alternatives and are partitioned into disjoint districts. The goal is to choose one alternative as the winner using a mechanism which first decides a representative alternative…

Computer Science and Game Theory · Computer Science 2023-01-10 Aris Filos-Ratsikas , Alexandros A. Voudouris

We study a generalization of conditional probability for arbitrary ordered vector spaces. A related problem is that of assigning a numerical value to one vector relative to another. We characterize the groups for which these generalized…

Probability · Mathematics 2026-01-12 Nicolas Monod

We introduce a methodology and framework for expressing general preference information in logic programming under the answer set semantics. An ordered logic program is an extended logic program in which rules are named by unique terms, and…

Artificial Intelligence · Computer Science 2007-05-23 J. P. Delgrande , T. Schaub , H. Tompits

A high degree of control over the structure and dynamics of domain patterns in nonequilibrium systems can be achieved by applying nonuniform external fields near parity breaking front bifurcations. An external field with a linear spatial…

patt-sol · Physics 2009-10-28 A. Hagberg , E. Meron , I. Rubinstein , B. Zaltzman

We introduce and study the property of orthogonal independence, a restricted additivity axiom applying when alternatives are orthogonal. The axiom requires that the preference for one marginal change over another should be maintained after…

Theoretical Economics · Economics 2020-02-14 Christopher P. Chambers , Federico Echenique

This paper proposes a voting process in which voters allocate fractional votes to their expected utility in different domains: over proposals, other participants, and sets containing proposals and participants. This approach allows for a…

Social and Information Networks · Computer Science 2025-04-21 Yasushi Sakai , Parfait Atchade-Adelomou , Ryan Jiang , Luis Alonso , Kent Larson , Ken Suzuki

In this paper we characterize the Pr\"ufer v-multiplication domain as a class of essential domains verifying an additional property on the closure of some families of prime ideals, with respect to the constructible topology.

Commutative Algebra · Mathematics 2014-10-16 C. A. Finocchiaro , F. Tartarone

In the field of Judgment Aggrgation, a domain, that is a subset of a Cartesian power of $\{0,1\}$, is considered to reflect abstract rationality restrictions on vectors of two-valued judgments on a number of issues. We are interested in the…

Computational Complexity · Computer Science 2019-09-04 Josep Díaz , Lefteris Kirousis , Sofia Kokonezi , John Livieratos

A causal set is a partially ordered set on a countably infinite ground-set such that each element is above finitely many others. A natural extension of a causal set is an enumeration of its elements which respects the order. We bring…

Probability · Mathematics 2011-09-22 Graham Brightwell , Malwina Luczak

Most comparisons of preferences are instances of single-crossing dominance. We examine the lattice structure of single-crossing dominance, proving characterisation, existence and uniqueness results for minimum upper bounds of arbitrary sets…

Theoretical Economics · Economics 2025-12-16 Gregorio Curello , Ludvig Sinander

The purpose of this work is to find out how different library classification systems and linguistic ontologies arrange a particular domain of interest and what are the limitations for information retrieval. We use knowledge representation…

Artificial Intelligence · Computer Science 2023-06-21 Subhashis Das , Debashis Naskar , Sayon Roy

This paper characterizes the single-peaked domain on a tree via the strategy-proofness of extreme rules defined on that tree. For any tree, these rules are unanimous and anonymous on any preference domain. In particular, we show that they…

Theoretical Economics · Economics 2026-04-30 Mihir Bhattacharya , Anup Pramanik

Humans continuously adapt their style and language to a variety of domains. However, a reliable definition of `domain' has eluded researchers thus far. Additionally, the notion of discrete domains stands in contrast to the multiplicity of…

Computation and Language · Computer Science 2016-10-31 Sebastian Ruder , Parsa Ghaffari , John G. Breslin

We consider a model where a subset of candidates must be selected based on voter preferences, subject to general constraints that specify which subsets are feasible. This model generalizes committee elections with diversity constraints,…

Computer Science and Game Theory · Computer Science 2026-02-10 Piotr Skowron