相关论文: Condorcet domains of tiling type

CD Tools is a Prolog library for experimenting with condensed detachment in first-order ATP, which puts a recent formal view centered around proof structures into practice. From the viewpoint of first-order ATP, condensed detachment offers…

This paper establishes a universality result for scaling limits of uniformly random lozenge tilings of large domains. We prove that whenever a boundary of the domain has three adjacent straight segments inclined under 120 degrees to each…

In 1885, Fedorov discovered that a convex domain can form a lattice tiling of the Euclidean plane if and only if it is a parallelogram or a centrally symmetric hexagon. This paper proves the following results: Besides parallelograms and…

This paper considers the problem of representative selection: choosing a subset of data points from a dataset that best represents its overall set of elements. This subset needs to inherently reflect the type of information contained in the…

Popular matchings provide a model of matching under preferences in which a solution corresponds to a Condorcet winner in voting systems. In a bipartite graph in which the vertices have preferences over their neighbours, a matching is…

The paper describes an algorithm to compute a consensus sequence from a set of DNA sequences of approximatively identical length generated by 3rd sequencing generation technologies. Its purpose targets DNA storage and is guided by specific…

Coherence is an important aspect of text quality and is crucial for ensuring its readability. One important limitation of existing coherence models is that training on one domain does not easily generalize to unseen categories of text.…

Space filling designs are central to studying complex systems in various areas of science. They are used for obtaining an overall understanding of the behaviour of the response over the input space, model construction and uncertainty…

We present a unifying framework encompassing many social choice settings. Viewing each social choice setting as voting in a suitable metric space, we consider a general model of social choice over metric spaces, in which---similarly to the…

We propose a simple method for combining together voting rules that performs a run-off between the different winners of each voting rule. We prove that this combinator has several good properties. For instance, even if just one of the base…

We provide a new framework for generating multiple good quality partitions (clusterings) of a single data set. Our approach decomposes this problem into two components, generating many high-quality partitions, and then grouping these…

Let $\textbf{a}_1,\dots, \textbf{a}_r$ be vectors in a half-space of $\mathbb{R}^n$. We call $$C=\textbf{a}_1\mathbb{R}^++\cdots+\textbf{a}_r \mathbb{R}^+$$ a convex polyhedral cone, and call $\{\textbf{a}_1,\dots, \textbf{a}_r\}$ a…

We show the existence of classes of non-tiling domains satisfying P\'{o}lya's conjecture in any dimension, in both the Euclidean and non-Euclidean cases. This is a consequence of a more general observation asserting that if a domain…

We introduce a continuous domain for function spaces over topological spaces which are not core-compact. Notable examples of such topological spaces include the real line with the upper limit topology, which is used in solution of initial…

Divisor methods are well known to satisfy house monotonicity, which allows representative seats to be allocated sequentially. We focus on stationary divisor methods defined by a rounding cutpoint $c \in [0,1]$. For such methods with…

We introduce a method to estimate the size of the domain of definition of the solutions of a meromorphic vector field on a neighborhood of its pole divisor. The corresponding techniques are, in a certain sense, quantitative versions of some…

This paper introduces Propose or Vote (PoV), a democratic procedure for collective decision-making and elections that does not rely on a central mechanism designer. In the first stage, members of a polity choose whether to become…

This paper introduces a novel binary stability property for voting rules-called binary self-selectivity-by which a society considering whether to replace its voting rule using itself in pairwise elections will choose not to do so. In…

We generalise the notion of a Barge-Diamond complex, in the one-dimensional case, to a mixed system of tiling substitutions. This gives a way of describing the associated tiling space as an inverse limit of Barge-Diamond complexes. We give…

Mechanism design is concerned with settings where a policymaker (or social planner) faces the problem of aggregating the announced preferences of multiple agents into a collective (or social), system-wide decision. One of the most important…