English
Related papers

Related papers: Recognizing Linked Domain in Polynomial Time

200 papers

We argue that traditional formulations of the reduction thesis that tie it to privileged relational operations do not suffice for Peirce's justification of the categories, and invite the charge of gerrymandering to make it come out as true.…

Logic · Mathematics 2024-06-21 Sergiy Koshkin

We study a model of temporal voting where there is a fixed time horizon, and at each round the voters report their preferences over the available candidates and a single candidate is selected. Prior work has adapted popular notions of…

Computer Science and Game Theory · Computer Science 2025-02-11 Edith Elkind , Svetlana Obraztsova , Jannik Peters , Nicholas Teh

In this short note, we are concerned with the fairness condition "A and B hold almost equally often", which is important for specifying and verifying the correctness of non-terminating processes and protocols. We introduce the logic of…

Logic in Computer Science · Computer Science 2023-06-05 Thomas Studer

We address the problem of determining if a discrete time switched consensus system converges for any switching sequence and that of determining if it converges for at least one switching sequence. For these two problems, we provide…

Systems and Control · Computer Science 2015-05-22 Pierre-Yves Chevalier , Julien M. Hendrickx , Raphaël M. Jungers

The classical Arrow's Theorem answers "how can $n$ voters obtain a collective preference on a set of outcomes, if they have to obey certain constraints?" We give an analogue in the judgment aggregation framework of List and Pettit,…

Combinatorics · Mathematics 2018-10-30 Yan X Zhang

We introduce a temporal logic to reason on global applications in an asynchronous setting. First, we define the Distributed States Logic (DSL), a modal logic for localities that embeds the local theories of each component into a theory of…

Logic in Computer Science · Computer Science 2016-08-31 Carlo Montangero , Laura Semini

Arrow's Impossibility Theorem establishes bounds on what we can require from voting systems. Given satisfaction of a small collection of "fairness" axioms, it shows votes can only exist as dictatorships in which one voter determines all…

Logic · Mathematics 2023-11-17 Alex Hall

Domination theory has been studied extensively in the context of binary monotone systems, where the structure function is a sum of products of the component state variables, and with coefficients given by the signed domination function.…

Combinatorics · Mathematics 2025-02-26 Arne Bang Huseby

Participatory budgeting (PB) is a democratic process for allocating funds to projects based on the votes of community members. PB outcomes are commonly evaluated for how they reflect voters preferences (e.g., social welfare) and the extent…

Computer Science and Game Theory · Computer Science 2024-12-03 Roy Fairstein , Reshef Meir , Kobi Gal

We generalize Gaeta's Theorem to the family of determinantal schemes. In other words, we show that the schemes defined by minors of a fixed size of a matrix with polynomial entries belong to the same G-biliaison class of a complete…

Algebraic Geometry · Mathematics 2014-01-14 Elisa Gorla

The lifetime of a system of connected units under some natural assumptions can be represented as a random variable Y defined as a weighted lattice polynomial of random lifetimes of its components. As such, the concept of a random variable Y…

Probability · Mathematics 2008-05-28 Alexander Dukhovny , Jean-Luc Marichal

There is a growing need for discrete choice models that account for the complex nature of human choices, escaping traditional behavioral assumptions such as the transitivity of pairwise preferences. Recently, several parametric models of…

Machine Learning · Computer Science 2018-10-12 Rahul Makhijani

We study situations where a group of voters need to take a collective decision over a number of public issues, with the goal of getting a result that reflects the voters' opinions in a proportional manner. Our focus is on interconnected…

Computer Science and Game Theory · Computer Science 2025-09-25 Julian Chingoma , Umberto Grandi , Arianna Novaro

Winner selection by majority, in an election between two candidates, is the only rule compatible with democratic principles. Instead, when the candidates are three or more and the voters rank candidates in order of preference, there are no…

Physics and Society · Physics 2016-04-19 Pierluigi Contucci , Emanuele Panizzi , Federico Ricci-Tersenghi , Alina Sîrbu

We introduce two-crossing elections as a generalization of single-crossing elections, showing a number of new results. First, we show that two-crossing elections can be recognized in polynomial time, by reduction to the well-studied…

Computer Science and Game Theory · Computer Science 2022-06-28 Andrei Constantinescu , Roger Wattenhofer

Selection, the tendency of some traits to become more frequent than others in a population under the influence of some (natural or artificial) agency, is a key component of Darwinian evolution and countless other natural and social…

Populations and Evolution · Quantitative Biology 2017-05-24 Matteo Smerlak , Ahmed Youssef

Nowadays there is an increasing interest of physicists in finding regularities related to social phenomena. This interest is clearly motivated by applications that a statistical mechanical description of the human behavior may have in our…

Physics and Society · Physics 2011-10-28 M. C. Mantovani , H. V. Ribeiro , M. V. Moro , S. Picoli , R. S. Mendes

Consider an election where the set of candidates is partitioned into parties, and each party must choose exactly one candidate to nominate for the election held over all nominees. The Necessary President problem asks whether a candidate, if…

Computer Science and Game Theory · Computer Science 2026-02-12 Katarína Cechlárová , Ildikó Schlotter

Scoring protocols are a broad class of voting systems. Each is defined by a vector $(\alpha_1,\alpha_2,...,\alpha_m)$, $\alpha_1 \geq \alpha_2 \geq >... \geq \alpha_m$, of integers such that each voter contributes $\alpha_1$ points to…

Computer Science and Game Theory · Computer Science 2007-05-23 Edith Hemaspaandra , Lane A. Hemaspaandra

The classical Thistlethwaite theorem for links can be phrased as asserting that the Kauffman bracket of a link can be obtained from an evaluation of the Bollob\'as-Riordan polynomial of a ribbon graph associated to one of the link's…

Geometric Topology · Mathematics 2024-12-18 Sergei Chmutov , Qingying Deng , Joanna A. Ellis-Monaghan , Sergei Lando , Wout Moltmaker
‹ Prev 1 4 5 6 7 8 10 Next ›