中文
相关论文

相关论文: Optimal Average Satisfaction and Extended Justifie…

200 篇论文

We design an expected polynomial-time, truthful-in-expectation, (1-1/e)-approximation mechanism for welfare maximization in a fundamental class of combinatorial auctions. Our results apply to bidders with valuations that are m matroid rank…

计算机科学与博弈论 · 计算机科学 2011-04-19 Shaddin Dughmi , Tim Roughgarden , Qiqi Yan

In this paper we address the problem of electing a committee among a set of $m$ candidates and on the basis of the preferences of a set of $n$ voters. We consider the approval voting method in which each voter can approve as many candidates…

最优化与控制 · 数学 2017-07-31 Diego Ponce , Justo Puerto , Federica Ricca , Andrea Scozzari

We prove axiomatic characterizations of several important multiwinner rules within the class of approval-based committee choice rules. These are voting rules that return a set of (fixed-size) committees. In particular, we provide axiomatic…

计算机科学与博弈论 · 计算机科学 2023-09-22 Martin Lackner , Piotr Skowron

Approval voting is a common method of preference aggregation where voters vote by ``approving'' of a subset of candidates and the winner(s) are those who are approved of by the largest number of voters. In approval voting, the degree to…

计算机科学与博弈论 · 计算机科学 2023-07-19 Hari Sarang Nathan

Platforms for online civic participation rely heavily on methods for condensing thousands of comments into a relevant handful, based on whether participants agree or disagree with them. These methods should guarantee fair representation of…

计算机科学与博弈论 · 计算机科学 2023-12-25 Daniel Halpern , Gregory Kehne , Ariel D. Procaccia , Jamie Tucker-Foltz , Manuel Wüthrich

Finding a representative cohort from a broad pool of candidates is a goal that arises in many contexts such as choosing governing committees and consumer panels. While there are many ways to define the degree to which a cohort represents a…

数据结构与算法 · 计算机科学 2022-05-19 Monika Henzinger , Charlotte Peale , Omer Reingold , Judy Hanwen Shen

When aggregating preferences of agents via voting, two desirable goals are to incentivize agents to participate in the voting process and then identify outcomes that are Pareto efficient. We consider participation as formalized by Brandl,…

计算机科学与博弈论 · 计算机科学 2017-05-02 Haris Aziz , Pang Luo , Christine Rizkallah

In the late 19th century, Swedish mathematician Lars Edvard Phragm\'{e}n proposed a load-balancing approach for selecting committees based on approval ballots. We consider three committee voting rules resulting from this approach: two…

计算机科学与博弈论 · 计算机科学 2023-02-07 Markus Brill , Rupert Freeman , Svante Janson , Martin Lackner

Committee selection with diversity or distributional constraints is a ubiquitous problem. However, many of the formal approaches proposed so far have certain drawbacks including (1) computationally intractability in general, and (2)…

人工智能 · 计算机科学 2018-04-02 Haris Aziz

We discuss voting scenarios in which the set of voters (agents) and the set of alternatives are the same; that is, voters select a single representative from among themselves. Such a scenario happens, for instance, when a committee selects…

计算机科学与博弈论 · 计算机科学 2019-07-23 Yakov Babichenko , Oren Dean , Moshe Tennenholtz

A preference matrix $M$ has an entry for each pair of candidates in an election whose value $p_{ij}$ represents the proportion of voters that prefer candidate $i$ over candidate $j$. The matrix is rationalizable if it is consistent with a…

离散数学 · 计算机科学 2024-06-03 Agnes Totschnig , Rohit Vasishta , Adrian Vetta

In social choice theory, anonymity (all agents being treated equally) and neutrality (all alternatives being treated equally) are widely regarded as ``minimal demands'' and ``uncontroversial'' axioms of equity and fairness. However, the ANR…

计算机科学与博弈论 · 计算机科学 2023-07-14 Lirong Xia

An electorate with fully-ranked innate preferences casts approval votes over a finite set of alternatives. As a result, only partial information about the true preferences is revealed to the voting authorities. In an effort to understand…

计算机科学与博弈论 · 计算机科学 2023-10-09 Andrei Constantinescu , Roger Wattenhofer

Addressing the large inefficiencies generated by the Deferred Acceptance (DA) mechanism requires priority violations, but which ones are justifiable? The leading approach is to ask individuals if they consent to waive their priority…

理论经济学 · 经济学 2026-04-09 Josué Ortega , R. Pablo Arribillaga

We look at stochastic optimization problems through the lens of statistical decision theory. In particular, we address admissibility, in the statistical decision theory sense, of the natural sample average estimator for a stochastic…

最优化与控制 · 数学 2020-10-23 Amitabh Basu , Tu Nguyen , Ao Sun

Assume $k$ candidates need to be selected. The candidates appear over time. Each time one appears, it must be immediately selected or rejected -- a decision that is made by a group of individuals through voting. Assume the voters use…

计算机科学与博弈论 · 计算机科学 2022-05-09 Virginie Do , Matthieu Hervouin , Jérôme Lang , Piotr Skowron

In this paper we study several monotonicity axioms in approval-based multi-winner voting rules. We consider monotonicity with respect to the support received by the winners and also monotonicity in the size of the committee. Monotonicity…

计算机科学与博弈论 · 计算机科学 2019-02-25 Luis Sánchez-Fernández , Jesús A. Fisteus

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…

计算机科学与博弈论 · 计算机科学 2020-12-10 Pallavi Jain , Krzysztof Sornat , Nimrod Talmon , Meirav Zehavi

Generalized from the concept of consensus, this paper considers a group of edge agreements, i.e. constraints defined for neighboring agents, in which each pair of neighboring agents is required to satisfy one edge agreement constraint. Edge…

最优化与控制 · 数学 2023-12-04 Zehui Lu , Shaoshuai Mou

We investigate approval-based committee voting with incomplete information about the approval preferences of voters. We consider several models of incompleteness where each voter partitions the set of candidates into approved, disapproved,…

计算机科学与博弈论 · 计算机科学 2024-08-21 Aviram Imber , Jonas Israel , Markus Brill , Benny Kimelfeld