English
Related papers

Related papers: On the Computational Complexity of Non-dictatorial…

200 papers

In this paper, we consider a population of individuals who have actions and opinions, which coevolve, mutually influencing one another on a complex network structure. In particular, we formulate a control problem for this social network, in…

Systems and Control · Electrical Eng. & Systems 2026-05-12 Roberta Raineri , Mengbin Ye , Lorenzo Zino

When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to solve the nondeterminism. It has been observed that for certain…

Cryptography and Security · Computer Science 2007-06-13 Konstantinos Chatzikokolakis , Catuscia Palamidessi

Selective rationalization has become a common mechanism to ensure that predictive models reveal how they use any available features. The selection may be soft or hard, and identifies a subset of input features relevant for prediction. The…

Computation and Language · Computer Science 2019-12-17 Mo Yu , Shiyu Chang , Yang Zhang , Tommi S. Jaakkola

In a previous paper, we have shown that any Boolean formula can be encoded as a linear programming problem in the framework of Bayesian probability theory. When applied to NP-complete algorithms, this leads to the fundamental conclusion…

Data Structures and Algorithms · Computer Science 2012-12-21 Michel Feldmann

Democracy is not a single mechanism. It is a space of possible configurations -- a spectrum stretching from pure direct participation to full delegation of authority. The systems we live under today occupy a narrow band of that spectrum,…

Computers and Society · Computer Science 2026-04-24 Diego Macrini

Generally, multi-objective optimisation problems are solved exactly or approximated by solving a series of scalarisations, for example by dichotomic search. In this paper, we take a different approach and attempt to compute the set of all…

Optimization and Control · Mathematics 2026-01-28 Oliver Bachtler , Felix Fritz , Stefan Ruzika

We prove that the constructive weighted coalitional manipulation problem for the Schulze voting rule can be solved in polynomial time for an unbounded number of candidates and an unbounded number of manipulators.

Computer Science and Game Theory · Computer Science 2020-07-31 Julian Müller , Sven Kosub

Direct democracy is a special case of an ensemble of classifiers, where every person (classifier) votes on every issue. This fails when the average voter competence (classifier accuracy) falls below 50%, which can happen in noisy settings…

Computer Science and Game Theory · Computer Science 2018-07-23 Malik Magdon-Ismail , Lirong Xia

We study the problem of non-Bayesian social learning with uncertain models, in which a network of agents seek to cooperatively identify the state of the world based on a sequence of observed signals. In contrast with the existing…

Optimization and Control · Mathematics 2019-09-11 César A. Uribe , James Z. Hare , Lance Kaplan , Ali Jadbabaie

Permanent citizens' assemblies are ongoing deliberative bodies composed of randomly selected citizens, organized into panels that rotate over time. Unlike one-off panels, which represent the population in a single snapshot, permanent…

Computer Science and Game Theory · Computer Science 2026-02-19 Yusuf Hakan Kalayci , Evi Micha

We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof…

Logic in Computer Science · Computer Science 2023-10-20 Alexander V. Gheorghiu , David J. Pym

The term "diffusion of responsibility'' refers to situations in which multiple agents share responsibility for an outcome, obscuring individual accountability. This paper examines this frequently undesirable phenomenon in the context of…

Multiagent Systems · Computer Science 2025-06-10 Pavel Naumov , Jia Tao

Aggregation is a fundamental behavior for swarm robotics that requires a system to gather together in a compact, connected cluster. In 2014, Gauci et al. proposed a surprising algorithm that reliably achieves swarm aggregation using only a…

Robotics · Computer Science 2021-08-24 Joshua J. Daymude , Noble C. Harasha , Andréa W. Richa , Ryan Yiu

We expect that democracy enables us to utilize collective intelligence such that our collective decisions build and enhance social welfare, and such that we accept their distributive and normative consequences. Collective decisions are…

Physics and Society · Physics 2021-04-06 Jan Lorenz , Martin Neumann

Most work on manipulation assumes that all preferences are known to the manipulators. However, in many settings elections are open and sequential, and manipulators may know the already cast votes but may not know the future votes. We…

Computer Science and Game Theory · Computer Science 2013-10-28 Edith Hemaspaandra , Lane A. Hemaspaandra , Joerg Rothe

In large scale collective decision making, social choice is a normative study of how one ought to design a protocol for reaching consensus. However, in instances where the underlying decision space is too large or complex for ordinal…

Computer Science and Game Theory · Computer Science 2017-10-03 Brandon Fain , Ashish Goel , Kamesh Munagala , Sukolsak Sakshuwong

Compositionality is one of the fundamental abilities of the human reasoning process, that allows to decompose a complex problem into simpler elements. Such property is crucial also for neural networks, especially when aiming for a more…

Machine Learning · Computer Science 2025-06-19 Luigi Quarantiello , Andrea Cossu , Vincenzo Lomonaco

We study a budget aggregation setting where voters express their preferred allocation of a fixed budget over a set of alternatives, and a mechanism aggregates these preferences into a single output allocation. Motivated by scenarios in…

Computer Science and Game Theory · Computer Science 2025-05-12 Ulrike Schmidt-Kraepelin , Warut Suksompong , Markus Utke

Sortition is a political system in which decisions are made by panels of randomly selected citizens. The process for selecting a sortition panel is traditionally thought of as uniform sampling without replacement, which has strong fairness…

Computer Science and Game Theory · Computer Science 2020-10-30 Bailey Flanigan , Paul Gölz , Anupam Gupta , Ariel Procaccia

Assortment optimization refers to the problem of designing a slate of products to offer potential customers, such as stocking the shelves in a convenience store. The price of each product is fixed in advance, and a probabilistic choice…

Computer Science and Game Theory · Computer Science 2017-11-09 Nicole Immorlica , Brendan Lucier , Jieming Mao , Vasilis Syrgkanis , Christos Tzamos
‹ Prev 1 8 9 10 Next ›