English
Related papers

Related papers: On Multi-Level Apportionment

200 papers

Given a weighted, ordered query set $Q$ and a partition of $Q$ into classes, we study the problem of computing a minimum-cost decision tree that, given any query $q$ in $Q$, uses equality tests and less-than comparisons to determine the…

Data Structures and Algorithms · Computer Science 2025-01-28 Marek Chrobak , Neal E. Young

Despite extensive theoretical research on proportionality in approval-based multiwinner voting, its impact on which committees and candidates can be selected in practice remains poorly understood. We address this gap by (i) analyzing the…

Computer Science and Game Theory · Computer Science 2025-11-13 Niclas Boehmer , Lara Glessen , Jannik Peters

Liquid democracy is a novel paradigm for collective decision-making that gives agents the choice between casting a direct vote or delegating their vote to another agent. We consider a generalization of the standard liquid democracy setting…

Computer Science and Game Theory · Computer Science 2021-12-15 Markus Brill , Théo Delemazure , Anne-Marie George , Martin Lackner , Ulrike Schmidt-Kraepelin

We study the election control problem with multi-votes, where each voter can present a single vote according different views (or layers, we use "layer" to represent "view"). For example, according to the attributes of candidates, such as:…

Computational Complexity · Computer Science 2023-07-03 Fengbo Wang , Aizhong Zhou , Jianliang Xu

A notion of general manifolds is introduced. It covers all usual manifolds in mathematics. Essentially, it is a way how to get a bigger 'fibration' over a site which locally coincides with a given one. An enrichment with generalized…

Category Theory · Mathematics 2007-05-23 G. V. Kondratiev

We investigate the quantifier alternation hierarchy in first-order logic on finite words. Levels in this hierarchy are defined by counting the number of quantifier alternations in formulas. We prove that one can decide membership of a…

Formal Languages and Automata Theory · Computer Science 2014-04-29 Thomas Place , Marc Zeitoun

Bilevel learning refers to machine learning problems that can be formulated as bilevel optimization models, where decisions are organized in a hierarchical structure. This paradigm has recently gained considerable attention in machine…

Optimization and Control · Mathematics 2026-05-05 Riccardo Grazzi , Massimiliano Pontil , Saverio Salzo , Alain Zemkoho

Value-based argumentation enhances a classical abstract argumentation graph - in which arguments are modelled as nodes connected by directed arrows called attacks - with labels on arguments, called values, and an ordering on values, called…

Multiagent Systems · Computer Science 2019-07-23 Grzegorz Lisowski , Sylvie Doutre , Umberto Grandi

As Physics did in previous centuries, there is currently a common dream of extracting generic laws of nature in economics, sociology, neuroscience, by focalising the description of phenomena to a minimal set of variables and parameters,…

Physics and Society · Physics 2016-10-14 Fatihcan M. Atay , Sven Banisch , Philippe Blanchard , Bruno Cessac , Eckehard Olbrich

In frequently repeated matching scenarios, individuals may require diversification in their choices. Therefore, when faced with a set of potential outcomes, each individual may have an ideal lottery over outcomes that represents their…

Computer Science and Game Theory · Computer Science 2024-04-29 Rasoul Ramezanian

Rent division is the well-studied problem of fairly assigning rooms and dividing rent among a set of roommates within a single apartment. A shortcoming of existing solutions is that renters are assumed to be considering apartments in…

Computer Science and Game Theory · Computer Science 2025-01-14 Ariel D. Procaccia , Benjamin Schiffer , Shirley Zhang

Voting is a very general method of preference aggregation. A voting rule takes as input every voter's vote (typically, a ranking of the alternatives), and produces as output either just the winning alternative or a ranking of the…

Computer Science and Game Theory · Computer Science 2012-07-09 Vincent Conitzer , Tuomas Sandholm

Two-phase methods are commonly used to solve bi-objective combinatorial optimization problems. In the first phase, all extreme supported nondominated points are generated through a dichotomic search. This phase also allows the…

Data Structures and Algorithms · Computer Science 2025-04-10 Felipe O. Mota , Luís Paquete , Daniel Vanderpooten

In the house allocation problem with lower and upper quotas, we are given a set of applicants and a set of projects. Each applicant has a strictly ordered preference list over the projects, while the projects are equipped with a lower and…

Computer Science and Game Theory · Computer Science 2021-07-09 Ágnes Cseh , Tobias Friedrich , Jannik Peters

Consensus halving refers to the problem of dividing a resource into two parts so that every agent values both parts equally. Prior work has shown that when the resource is represented by an interval, a consensus halving with at most $n$…

Computer Science and Game Theory · Computer Science 2022-11-22 Paul W. Goldberg , Alexandros Hollender , Ayumi Igarashi , Pasin Manurangsi , Warut Suksompong

In fair division of indivisible goods, using sequences of sincere choices (or picking sequences) is a natural way to allocate the objects. The idea is as follows: at each stage, a designated agent picks one object among those that remain.…

Artificial Intelligence · Computer Science 2018-08-01 Aurélie Beynier , Sylvain Bouveret , Michel Lemaître , Nicolas Maudet , Simon Rey

Impartial selection has recently received much attention within the multi-agent systems community. The task is, given a directed graph representing nominations to the members of a community by other members, to select the member with the…

Computer Science and Game Theory · Computer Science 2022-05-25 Ioannis Caragiannis , George Christodoulou , Nicos Protopapas

The study of proportionality in multiwinner voting with approval ballots has received much attention in recent years. Typically, proportionality is captured by variants of the Justified Representation axiom, which say that cohesive groups…

Computer Science and Game Theory · Computer Science 2025-08-04 Matthew M. Casey , Edith Elkind

We study the assignment problem of objects to agents with heterogeneous preferences under distributional constraints. Each agent is associated with a publicly known type and has a private ordinal ranking over objects. We are interested in…

Data Structures and Algorithms · Computer Science 2019-05-02 Itai Ashlagi , Amin Saberi , Ali Shameli

The partition problem is a well-known basic NP-complete problem. We mainly consider the optimization version of it in this paper. The problem has been investigated from various perspectives for a long time and can be solved efficiently in…

Discrete Mathematics · Computer Science 2024-05-10 Susumu Kubo