中文
相关论文

相关论文: Approximate Core for Committee Selection via Multi…

200 篇论文

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…

计算机科学与博弈论 · 计算机科学 2026-01-07 Kamesh Munagala , Yiheng Shen , Kangning Wang

We consider the multiwinner election problem where the goal is to choose a committee of $k$ candidates given the voters' utility functions. We allow arbitrary additional constraints on the chosen committee, and the utilities of voters to…

计算机科学与博弈论 · 计算机科学 2023-05-05 Ivan-Aleksandar Mavrov , Kamesh Munagala , Yiheng Shen

We consider the problem of fairly allocating indivisible public goods. We model the public goods as elements with feasibility constraints on what subsets of elements can be chosen, and assume that agents have additive utilities across…

计算机科学与博弈论 · 计算机科学 2018-05-10 Brandon Fain , Kamesh Munagala , Nisarg Shah

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…

计算机科学与博弈论 · 计算机科学 2016-10-17 Brandon Fain , Ashish Goel , Kamesh Munagala

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,…

计算机科学与博弈论 · 计算机科学 2021-08-05 Grzegorz Pierczyński , Piotr Skowron

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…

计算机科学与博弈论 · 计算机科学 2026-05-08 Patrick Becker , Matthias Greger , 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…

计算机科学与博弈论 · 计算机科学 2025-12-19 Ratip Emin Berker , Emanuel Tewolde , Vincent Conitzer , Mingyu Guo , Marijn Heule , Lirong Xia

Sortition is based on the idea of choosing randomly selected representatives for decision making. The main properties that make sortition particularly appealing are fairness -- all the citizens can be selected with the same probability --…

计算机科学与博弈论 · 计算机科学 2024-06-04 Soroush Ebadian , Evi Micha

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…

计算机科学与博弈论 · 计算机科学 2026-05-22 Jiehua Chen , Christian Hatschka

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…

计算机科学与博弈论 · 计算机科学 2025-05-15 Dominik Peters

Fair resource allocation is a fundamental optimization problem with applications in operations research, networking, and economic and game theory. Research in these areas has led to the general acceptance of a class of $\alpha$-fair utility…

数据结构与算法 · 计算机科学 2020-11-17 Jelena Diakonikolas , Maryam Fazel , Lorenzo Orecchia

Polarization is a major concern for a well-functioning society. Often, mass polarization of a society is driven by polarizing political representation, even when the latter is easily preventable. The existing computational social choice…

计算机科学与博弈论 · 计算机科学 2025-09-03 Chris Dong , Martin Bullinger , Tomasz Wąs , Larry Birnbaum , Edith Elkind

We incorporate group fairness into the algorithmic centroid clustering problem, where $k$ centers are to be located to serve $n$ agents distributed in a metric space. We refine the notion of proportional fairness proposed in [Chen et al.,…

计算机科学与博弈论 · 计算机科学 2022-04-01 Bo Li , Lijun Li , Ankang Sun , Chenhao Wang , Yingfan Wang

The matching game is a cooperative game where the value of every coalition is the maximum revenue of players in the coalition can make by forming pairwise disjoint partners. The multiple partners matching game generalizes the matching game…

计算机科学与博弈论 · 计算机科学 2021-10-26 Han Xiao , Tianhang Lu , Qizhi Fang

In social choice there often arises a conflict between the majority principle (the search for a candidate that is as good as possible for as many voters as possible), and the protection of minority rights (choosing a candidate that is not…

计算机科学与博弈论 · 计算机科学 2023-04-06 Egor Ianovski , Aleksei Y. Kondratev

Multiwinner voting rules are used to select a small representative subset of candidates or items from a larger set given the preferences of voters. However, if candidates have sensitive attributes such as gender or ethnicity (when selecting…

计算机与社会 · 计算机科学 2018-06-20 L. Elisa Celis , Lingxiao Huang , Nisheeth K. Vishnoi

We study the problem of selection in the context of Bayesian persuasion. We are given multiple agents with hidden values (or quality scores), to whom resources must be allocated by a welfare-maximizing decision-maker. An intermediary with…

计算机科学与博弈论 · 计算机科学 2025-11-18 Yannan Bai , Kamesh Munagala , Yiheng Shen , Davidson Zhu

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…

计算机科学与博弈论 · 计算机科学 2018-06-29 Wei Chen , Xiaohan Shan , Xiaoming Sun , Jialin Zhang

We consider the problem of repeatedly allocating multiple shareable public goods that have limited availability in an online setting without the use of money. In our setting, agents have additive values, and the value each agent receives…

计算机科学与博弈论 · 计算机科学 2025-11-10 Chido Onyeze , David X. Lin , Siddhartha Banerjee , Éva Tardos

Fairness is a major concern in contemporary decision problems. In these situations, the objective is to maximize fairness while preserving the efficacy of the underlying decision-making problem. This paper examines repeated decisions on…

最优化与控制 · 数学 2022-12-21 Andrea Lodi , Sriram Sankaranarayanan , Guanyi Wang
‹ 上一页 1 2 3 10 下一页 ›