English
Related papers

Related papers: Obvious Independence of Clones

200 papers

Actual individual preferences are neither complete (=total) nor antisymmetric in general, so that at least every quasi-order must be an admissible input to a satisfactory choice rule. It is argued that the traditional notion of…

Combinatorics · Mathematics 2007-05-23 Jobst Heitzig

We consider the model of history-deterministic one-counter nets (OCNs). History-determinism is a property of transition systems that allows for a limited kind of non-determinism which can be resolved 'on-the-fly'. Token games, which have…

Formal Languages and Automata Theory · Computer Science 2026-05-28 Keya Prakash , K. S. Thejaswini

Inverse Optimal Control (IOC) aims to infer the underlying cost functional of an agent from observations of its expert behavior. This paper focuses on the IOC problem within the continuous-time linear quadratic regulator framework,…

Optimization and Control · Mathematics 2025-07-29 Meiling Yu , Lechen Feng , Lei Jiang , Yuan-Hua Ni

Measuring the statistical dependence between observed signals is a primary tool for scientific discovery. However, biological systems often exhibit complex non-linear interactions that currently cannot be captured without a priori knowledge…

There are a great many clone detection tools proposed in the literature. In this paper, we investigate the state of clone detection tool evaluation. We begin by surveying the clone detection benchmarks, and performing a multi-faceted…

Software Engineering · Computer Science 2020-06-30 Jeffrey Svajlenko , Chanchal K. Roy

Elections seem simple---aren't they just counting? But they have a unique, challenging combination of security and privacy requirements. The stakes are high; the context is adversarial; the electorate needs to be convinced that the results…

Do unique node identifiers help in deciding whether a network $G$ has a prescribed property $P$? We study this question in the context of distributed local decision, where the objective is to decide whether $G \in P$ by having each node run…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-12-24 Pierre Fraigniaud , Mika Göös , Amos Korman , Jukka Suomela

Fairness in multiwinner elections, a growing line of research in computational social choice, primarily concerns the use of constraints to ensure fairness. Recent work proposed a model to find a diverse \emph{and} representative committee…

Computer Science and Game Theory · Computer Science 2022-11-28 Kunal Relia

We focus on the strategyproofness of voting systems where voters must choose a number of options among several possibilities. These systems include those that are used for Participatory Budgeting, where we organize an election to determine…

Computer Science and Game Theory · Computer Science 2022-10-07 Johanne Cohen , Daniel Cordeiro , Valentin Dardilhac , Victor Glaser

Selecting the number of regimes in Hidden Markov models is an important problem. There are many criteria that are used to select this number, such as Akaike information criterion (AIC), Bayesian information criterion (BIC), integrated…

Methodology · Statistics 2024-09-23 Bouchra R Nasri , Bruno N Rémillard , Mamadou Y Thioub

Many real-world reinforcement learning problems have a hierarchical nature, and often exhibit some degree of partial observability. While hierarchy and partial observability are usually tackled separately (for instance by combining…

Artificial Intelligence · Computer Science 2017-09-13 Denis Steckelmacher , Diederik M. Roijers , Anna Harutyunyan , Peter Vrancx , Hélène Plisnier , Ann Nowé

We investigate how robust approval-based multiwinner voting rules are to small perturbations in the votes. In particular, we consider the extent to which a committee can change after we add/remove/swap one approval, and we consider the…

Computer Science and Game Theory · Computer Science 2026-01-28 Piotr Faliszewski , Grzegorz Gawron , Bartosz Kusek

State-dependent cloning machines that have so far been considered either deterministically copy a set of states approximately, or probablistically copy them exactly. In considering the case of two equiprobable pure states, we derive the…

Quantum Physics · Physics 2009-10-31 Anthony Chefles , Stephen M. Barnett

Though voting-based consensus algorithms in Blockchain outperform proof-based ones in energy- and transaction-efficiency, they are prone to incur wrong elections and bribery elections. The former originates from the uncertainties of…

Computer Science and Game Theory · Computer Science 2019-12-30 Shengling Wang , Xidi Qu , Qin Hu , Weifeng Lv

Quota-based fairness mechanisms like the so-called Rooney rule or four-fifths rule are used in selection problems such as hiring or college admission to reduce inequalities based on sensitive demographic attributes. These mechanisms are…

Computers and Society · Computer Science 2020-06-25 Vitalii Emelianov , Nicolas Gast , Krishna P. Gummadi , Patrick Loiseau

We focus on a generalization of the classic Minisum approval voting rule, introduced by Barrot and Lang (2016), and referred to as Conditional Minisum (CMS), for multi-issue elections with preferential dependencies. Under this rule, voters…

Computer Science and Game Theory · Computer Science 2025-06-10 Evangelos Markakis , Georgios Papasotiropoulos

This paper provides threshold policies with tight guarantees for online selection with convex cost (OSCC). In OSCC, a seller wants to sell some asset to a sequence of buyers with the goal of maximizing her profit. The seller can produce…

Computer Science and Game Theory · Computer Science 2024-01-24 Xiaoqi Tan , Siyuan Yu , Raouf Boutaba , Alberto Leon-Garcia

Impartial selection problems are concerned with the selection of one or more agents from a set based on mutual nominations from within the set. To avoid strategic nominations of the agents, the axiom of impartiality requires that the…

Computer Science and Game Theory · Computer Science 2024-10-01 Javier Cembrano , Max Klimm , Arturo Merino

We consider a committee voting on whether to adopt a reform under a quota rule, where members differ in how much they value the reform some supporting it, others opposing it. We examine how members can influence each other's votes through…

General Economics · Economics 2025-05-19 Ali Lazrak , Jianfeng Zhang

A new test of independence between random elements is presented in this article. The test is based on a functional of the Cram\'{e}r-von Mises type, which is applied to a $U$-process that is defined from the recurrence rates. Theorems of…

Statistics Theory · Mathematics 2019-08-12 Juan Kalemkerian , Diego Fernández