English
Related papers

Related papers: The core of an approval-based PB instance can be e…

200 papers

In the Approval Participatory Budgeting problem an agent prefers a set of projects $W'$ over $W$ if she approves strictly more projects in $W'$. A set of projects $W$ is in the core, if there is no other set of projects $W'$ and set of…

Multiagent Systems · Computer Science 2022-12-08 Reshef Meir

In an approval-based committee election, the goal is to select a committee consisting of $k$ out of $m$ candidates, based on $n$ voters who each approve an arbitrary number of the candidates. The core of such an election consists of all…

Computer Science and Game Theory · Computer Science 2025-05-15 Dominik Peters

Core stability is a natural and well-studied notion for group fairness in multi-winner voting, where the task is to select a committee from a pool of candidates. We study the setting where voters either approve or disapprove of each…

Computer Science and Game Theory · Computer Science 2025-12-19 Ratip Emin Berker , Emanuel Tewolde , Vincent Conitzer , Mingyu Guo , Marijn Heule , Lirong Xia

Acyclicity of individual preferences is a minimal assumption in social choice theory. We replace that assumption by the direct assumption that preferences have maximal elements on a fixed agenda. We show that the core of a simple game is…

Computer Science and Game Theory · Computer Science 2011-07-05 Masahiro Kumabe , H. Reiju Mihara

Motivated by civic problems such as participatory budgeting and multiwinner elections, we consider the problem of public good allocation: Given a set of indivisible projects (or candidates) of different sizes, and voters with different…

Computer Science and Game Theory · Computer Science 2021-10-26 Kamesh Munagala , Yiheng Shen , Kangning Wang , Zhiyi Wang

In an approval-based committee election, the task is to select a committee of up to $k$ candidates from a set of $m$ candidates based on the preferences of $n$ voters, each of whom approves a subset of the candidates. A central open…

Computer Science and Game Theory · Computer Science 2026-05-08 Patrick Becker , Matthias Greger , Dominik Peters

Coreness represents solution concepts related to core in cooperative games, which captures the stability of players. Motivated by the scale effect in social networks, economics and other scenario, we study the coreness of cooperative game…

Computer Science and Game Theory · Computer Science 2018-06-29 Wei Chen , Xiaohan Shan , Xiaoming Sun , Jialin Zhang

The ability to measure the satisfaction of (groups of) voters is a crucial prerequisite for formulating proportionality axioms in approval-based participatory budgeting elections. Two common - but very different - ways to measure the…

Computer Science and Game Theory · Computer Science 2023-10-19 Markus Brill , Stefan Forster , Martin Lackner , Jan Maly , Jannik Peters

In an indivisible participatory budgeting (PB) framework, we have a limited budget that is to be distributed among a set of projects, by aggregating the preferences of voters for the projects. All the prior work on indivisible PB assumes…

Computer Science and Game Theory · Computer Science 2023-05-19 Gogulapati Sreedurga

We study the setting of committee elections, where a group of individuals needs to collectively select a given size subset of available objects. This model is relevant for a number of real-life scenarios including political elections,…

Computer Science and Game Theory · Computer Science 2021-08-05 Grzegorz Pierczyński , Piotr Skowron

Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish things that the individual agents cannot, or can do things more…

Computer Science and Game Theory · Computer Science 2009-09-29 Vincent Conitzer , Tuomas Sandholm

We consider the participatory budgeting problem where each of $n$ voters specifies additive utilities over $m$ candidate projects with given sizes, and the goal is to choose a subset of projects (i.e., a committee) with total size at most…

Computer Science and Game Theory · Computer Science 2026-01-07 Kamesh Munagala , Yiheng Shen , Kangning Wang

In participatory budgeting, communities collectively decide on the allocation of public tax dollars for local public projects. In this work, we consider the question of fairly aggregating the preferences of community members to determine an…

Computer Science and Game Theory · Computer Science 2016-10-17 Brandon Fain , Ashish Goel , Kamesh Munagala

The analysis discussed in this paper is based on a well-known NP-complete problem which is called satisfiability problem or SAT. From SAT a new NP-complete problem is derived, which is described by a Boolean function called core function.…

Computational Complexity · Computer Science 2018-02-16 Angelo Raffaele Meo

This paper develops a recent line of economic theory seeking to understand public goods economies using methods of topological analysis. Our first main result is a very clean characterization of the economy's core (the standard solution…

Computer Science and Game Theory · Computer Science 2017-05-05 Greg Bodwin

We explore the core concept in a generalization of the housing market model where agents own fractional endowments while maintaining ordinal preferences. Recognizing that individuals are easier than coalitions to block an allocation, we…

Theoretical Economics · Economics 2025-08-18 Jingsheng Yu , Jun Zhang

Multi-winner approval voting selects a size-$k$ committee that aggregates voters' approval preferences over a set of alternatives. A central question is coalitional stability: No coalition should be able to pick a committee -- of size at…

Computer Science and Game Theory · Computer Science 2026-05-22 Jiehua Chen , Christian Hatschka

We study a generalization of the standard approval-based model of participatory budgeting (PB), in which voters are providing approval ballots over a set of predefined projects and -- in addition to a global budget limit, there are several…

Computer Science and Game Theory · Computer Science 2020-12-10 Pallavi Jain , Krzysztof Sornat , Nimrod Talmon , Meirav Zehavi

We consider several notions of well-foundedness of cardinals in the absence of the Axiom of Choice. Some of these have been conflated by some authors, but we separate them carefully. We then consider implications among these, and also…

Logic · Mathematics 2024-01-17 Andreas Blass , Dhruv Kulshreshtha

The core is a quintessential solution concept for profit sharing in cooperative game theory. An imputation allocates the worth of the given game among its agents. The imputation lies in the core of the game if, for each sub-coalition, the…

Computer Science and Game Theory · Computer Science 2025-02-05 Rohith Reddy Gangam , Shayan Taherijam , Vijay V. Vazirani
‹ Prev 1 2 3 10 Next ›