English
Related papers

Related papers: Welfare Maximization Entices Participation

200 papers

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

Computer Science and Game Theory · Computer Science 2016-11-10 Haris Aziz

By relaxing the dominating set in three ways (e.g., from "each member beats every non-member" to "each member beats or ties every non-member, with an additional requirement that at least one member beat every non-member"), we propose a new…

Theoretical Economics · Economics 2024-03-26 Fujun Hou

We study the efficiency (in terms of social welfare) of truthful and symmetric mechanisms in one-sided matching problems with {\em dichotomous preferences} and {\em normalized von Neumann-Morgenstern preferences}. We are particularly…

Computer Science and Game Theory · Computer Science 2014-09-18 Marek Adamczyk , Piotr Sankowski , Qiang Zhang

Voting rules allow multiple agents to aggregate their preferences in order to reach joint decisions. Perhaps one of the most important desirable properties in this context is Condorcet-consistency, which requires that a voting rule should…

Computer Science and Game Theory · Computer Science 2016-02-26 Felix Brandt , Christian Geist , Dominik Peters

We study mechanism design problems in the {\em ordinal setting} wherein the preferences of agents are described by orderings over outcomes, as opposed to specific numerical values associated with them. This setting is relevant when agents…

Computer Science and Game Theory · Computer Science 2014-03-11 Deeparnab Chakrabarty , Chaitanya Swamy

We initiate the work towards a comprehensive picture of the smoothed satisfaction of voting axioms, to provide a finer and more realistic foundation for comparing voting rules. We adopt the smoothed social choice framework, where an…

Theoretical Economics · Economics 2021-06-04 Lirong Xia

Approval voting is widely used for making multi-winner voting decisions. The canonical rule (also called Approval Voting) used in the setting aims to maximize social welfare by selecting candidates with the highest number of approvals. We…

Computer Science and Game Theory · Computer Science 2026-04-21 Haris Aziz , Yuhang Guo , Venkateswara Rao Kagita , Baharak Rastegari , Mashbat Suzuki

We design two mechanisms that ensure that the majority preferred option wins in all equilibria. The first one is a simultaneous game where agents choose other agents to cooperate with on top of the vote for an alternative, thus overcoming…

Theoretical Economics · Economics 2023-10-12 Kirneva Margarita , Núñez Matías

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

Computer Science and Game Theory · Computer Science 2017-05-02 Haris Aziz , Pang Luo , Christine Rizkallah

We consider the egalitarian welfare aspects of random assignment mechanisms when agents have unrestricted cardinal utilities over the objects. We give bounds on how well different random assignment mechanisms approximate the optimal…

Computer Science and Game Theory · Computer Science 2015-07-27 Haris Aziz , Jiashu Chen , Aris Filos-Ratsikas , Simon Mackenzie , Nicholas Mattei

Social decision schemes (SDSs) map the ordinal preferences of individual voters over multiple alternatives to a probability distribution over the alternatives. In order to study the axiomatic properties of SDSs, we lift preferences over…

Computer Science and Game Theory · Computer Science 2024-08-27 Felix Brandt , Patrick Lederer , Warut Suksompong

We study the problem of approximate social welfare maximization (without money) in one-sided matching problems when agents have unrestricted cardinal preferences over a finite set of items. Random priority is a very well-known…

Computer Science and Game Theory · Computer Science 2014-05-07 Aris Filos-Ratsikas , Søren Kristoffer Stiil Frederiksen , Jie Zhang

One of the most celebrated results in mechanism design is Myerson's characterization of the revenue optimal auction for selling a single item. However, this result relies heavily on the assumption that buyers are indifferent to risk. In…

Computer Science and Game Theory · Computer Science 2018-10-08 Evdokia Nikolova , Emmanouil Pountourakis , Ger Yang

We consider a participatory budgeting problem in which each voter submits a proposal for how to divide a single divisible resource (such as money or time) among several possible alternatives (such as public projects or activities) and these…

Computer Science and Game Theory · Computer Science 2022-01-24 Rupert Freeman , David M. Pennock , Dominik Peters , Jennifer Wortman Vaughan

Let $\succsim$ be a binary relation on the set of simple lotteries over a countable outcome set $Z$. We provide necessary and sufficient conditions on $\succsim$ to guarantee the existence of a set $U$ of von Neumann--Morgenstern utility…

Classical Analysis and ODEs · Mathematics 2024-01-17 Paolo Leonetti

We initiate a novel direction in randomized social choice by proposing a new definition of agent utility for randomized outcomes. Each agent has a preference over all outcomes and a {\em quantile} parameter. Given a {\em lottery} over the…

Computer Science and Game Theory · Computer Science 2026-03-03 Ioannis Caragiannis , Fabian Frank , Sanjukta Roy

Most analyses of manipulation of voting schemes have adopted two assumptions that greatly diminish their practical import. First, it is usually assumed that the manipulators have full knowledge of the votes of the nonmanipulating agents.…

Computer Science and Game Theory · Computer Science 2012-10-19 Tyler Lu , Pingzhong Tang , Ariel D. Procaccia , Craig Boutilier

Two fundamental axioms in social choice theory are consistency with respect to a variable electorate and consistency with respect to components of similar alternatives. In the context of traditional non-probabilistic social choice, these…

Computer Science and Game Theory · Computer Science 2016-07-15 Florian Brandl , Felix Brandt , Hans Georg Seedig

To choose a suitable multiwinner voting rule is a hard and ambiguous task. Depending on the context, it varies widely what constitutes the choice of an ``optimal'' subset of alternatives. In this paper, we provide a quantitative analysis of…

Multiagent Systems · Computer Science 2020-09-01 Martin Lackner , Piotr Skowron

We study social welfare in one-sided matching markets where the goal is to efficiently allocate n items to n agents that each have a complete, private preference list and a unit demand over the items. Our focus is on allocation mechanisms…

Computer Science and Game Theory · Computer Science 2011-04-18 Anand Bhalgat , Deeparnab Chakrabarty , Sanjeev Khanna
‹ Prev 1 2 3 10 Next ›