中文
相关论文

相关论文: On Voting and Facility Location

200 篇论文

We consider a setting where goods are allocated to agents by way of an allocation platform (e.g., a matching platform). An ``allocation facilitator'' aims to increase the overall utility/social-good of the allocation by encouraging (some of…

计算机科学与博弈论 · 计算机科学 2025-08-27 Yohai Trabelsi , Abhijin Adiga , Yonatan Aumann , Sarit Kraus , S. S. Ravi

We study deterministic mechanisms for the two-facility location problem. Given the reported locations of n agents on the real line, such a mechanism specifies where to build the two facilities. The single-facility variant of this problem…

计算机科学与博弈论 · 计算机科学 2025-08-15 Elijah Journey Fullerton , Zeyuan Hu , C. Gregory Plaxton

The number of votes correlates strongly with the money spent in a campaign, but the relation between the two is not straightforward. Among other factors, the output of a ballot depends on the number of candidates, voters, and available…

物理与社会 · 物理学 2020-07-01 H. P. M. Melo , N. A. M. Araujo , J. S. Andrade

We study a variation of facility location problems (FLPs) that aims to improve the accessibility of agents to the facility within the context of mechanism design without money. In such a variation, agents have preferences on the ideal…

计算机科学与博弈论 · 计算机科学 2024-09-16 Hau Chan , Jianan Lin , Chenhao Wang , Yanxi Xie

In this paper, we propose a constrained heterogeneous facility location model where a set of alternative locations are feasible for building facilities and the number of facilities built at each location is limited. Supposing that a set of…

计算机科学与博弈论 · 计算机科学 2022-07-08 Qi Zhao , Wenjing Liu , Qizhi Fang , Qingqin Nong

The election control problem through social influence asks to find a set of nodes in a social network of voters to be the starters of a political campaign aiming at supporting a given target candidate. Voters reached by the campaign change…

社会与信息网络 · 计算机科学 2020-07-14 Mohammad Abouei Mehrizi , Federico Corò , Emilio Cruciani , Gianlorenzo D'Angelo

In large scale collective decision making, social choice is a normative study of how one ought to design a protocol for reaching consensus. However, in instances where the underlying decision space is too large or complex for ordinal…

计算机科学与博弈论 · 计算机科学 2017-10-03 Brandon Fain , Ashish Goel , Kamesh Munagala , Sukolsak Sakshuwong

Recent work has constructed economic mechanisms that are both truthful and differentially private. In these mechanisms, privacy is treated separately from the truthfulness; it is not incorporated in players' utility functions (and doing so…

计算机科学与博弈论 · 计算机科学 2012-11-14 Yiling Chen , Stephen Chong , Ian A. Kash , Tal Moran , Salil Vadhan

We examine an approval-based model of Liquid Democracy with a budget constraint on voting and delegating costs, aiming to centrally select casting voters ensuring complete representation of the electorate. From a computational complexity…

计算机科学与博弈论 · 计算机科学 2025-02-05 Shiri Alouf-Heffetz , Łukasz Janeczko , Grzegorz Lisowski , Georgios Papasotiropoulos

We consider the information design problem in spatial resource competition settings. Agents gather at a location deciding whether to move to another location for possibly higher level of resources, and the utility each agent gets by moving…

计算机科学与博弈论 · 计算机科学 2019-09-30 Pu Yang , Krishnamurthy Iyer , Peter Frazier

Nowadays there is an increasing interest of physicists in finding regularities related to social phenomena. This interest is clearly motivated by applications that a statistical mechanical description of the human behavior may have in our…

物理与社会 · 物理学 2011-10-28 M. C. Mantovani , H. V. Ribeiro , M. V. Moro , S. Picoli , R. S. Mendes

Studying complexity of various bribery problems has been one of the main research focus in computational social choice. In all the models of bribery studied so far, the briber has to pay every voter some amount of money depending on what…

计算机科学与博弈论 · 计算机科学 2020-12-14 Palash Dey

We study the distortion of one-sided and two-sided matching problems on the line. In the one-sided case, $n$ agents need to be matched to $n$ items, and each agent's cost in a matching is their distance from the item they were matched to.…

计算机科学与博弈论 · 计算机科学 2025-02-04 Aris Filos-Ratsikas , Vasilis Gkatzelis , Mohamad Latifian , Emma Rewinski , Alexandros A. Voudouris

Many democratic societies use district-based elections, where the region under consideration is geographically divided into districts and a representative is chosen for each district based on the preferences of the electors who reside…

计算机与社会 · 计算机科学 2022-03-09 Adway Mitra

How does one allocate a collection of resources to a set of strategic agents in a fair and efficient manner without using money? For in many scenarios it is not feasible to use money to compensate agents for otherwise unsatisfactory…

计算机科学与博弈论 · 计算机科学 2012-07-10 Richard Cole , Vasilis Gkatzelis , Gagan Goel

We study the Price of Anarchy of mechanisms for the well-known problem of one-sided matching, or house allocation, with respect to the social welfare objective. We consider both ordinal mechanisms, where agents submit preference lists over…

计算机科学与博弈论 · 计算机科学 2016-03-01 George Christodoulou , Aris Filos-Ratsikas , Soren Kristoffer Stiil Frederiksen , Paul W. Goldberg , Jie Zhang , Jinshan Zhang

Diffusion mechanism design, which investigate how to incentivise agents to invite as many colleagues to a multi-agent decision making as possible, is a new research paradigm at the intersection between microeconomics and computer science.…

计算机科学与博弈论 · 计算机科学 2024-11-13 Ryoto Ando , Kei Kimura , Taiki Todo , Makoto Yokoo

Metric distortion in social choice is a framework for evaluating how well voting rules minimize social cost when both voters and candidates exist in a shared metric space, with a voter's cost defined by their distance to a candidate. Voters…

计算机科学与博弈论 · 计算机科学 2025-02-14 Mohak Goyal , Sahasrajit Sarmasarkar

Randomisation and time-sharing are some of the oldest methods to achieve fairness. I make a case that applying these approaches to social choice settings constitutes a powerful paradigm that deserves an extensive and thorough examination. I…

计算机科学与博弈论 · 计算机科学 2020-02-25 Haris Aziz

We consider a stochastic online problem where $n$ applicants arrive over time, one per time step. Upon arrival of each applicant their cost per time step is revealed, and we have to fix the duration of employment, starting immediately. This…

数据结构与算法 · 计算机科学 2017-05-31 Yann Disser , John Fearnley , Martin Gairing , Oliver Göbel , Max Klimm , Daniel Schmand , Alexander Skopalik , Andreas Tönnis