English
Related papers

Related papers: Nonuniform Bribery

200 papers

We introduce Flexible Representative Democracy (FRD), a novel hybrid of Representative Democracy (RD) and Direct Democracy (DD) in which voters can alter the issue-dependent weights of a set of elected representatives. In line with the…

Multiagent Systems · Computer Science 2022-11-17 Ben Abramowitz , Nicholas Mattei

We study popularity for matchings under preferences. This solution concept captures matchings that do not lose against any other matching in a majority vote by the agents. A popular matching is said to be robust if it is popular among…

Data Structures and Algorithms · Computer Science 2025-10-23 Martin Bullinger , Gergely Csáji , Rohith Reddy Gangam , Parnian Shahkar

Perpetual voting studies fair collective decision-making in settings where many decisions are to be made, and is a natural framework for settings such as parliaments and the running of blockchain Decentralized Autonomous Organizations…

Computer Science and Game Theory · Computer Science 2024-08-19 Yotam Gafni , Ben Golan

We study a temporal voting model where voters have dynamic preferences over a set of public chores -- projects that benefit society, but impose individual costs on those affected by their implementation. We investigate the computational…

Computer Science and Game Theory · Computer Science 2025-08-13 Edith Elkind , Tzeh Yuan Neoh , Nicholas Teh

A core element in decision-making under uncertainty is the feedback on the quality of the performed actions. However, in many applications, such feedback is restricted. For example, in recommendation systems, repeatedly asking the user to…

Machine Learning · Computer Science 2021-07-13 Yonathan Efroni , Nadav Merlis , Aadirupa Saha , Shie Mannor

We introduce the notion of nonuniform coercion, which is the promotion of a value of one type to an enriched value of a different type via a nonuniform procedure. Nonuniform coercions are a generalization of the (uniform) coercions known in…

Logic in Computer Science · Computer Science 2011-03-18 Claudio Sacerdoti Coen , Enrico Tassi

In this paper, we demonstrate that policy iteration, introduced in the context of HJB equations in [Forsyth & Labahn, 2007], is an extremely simple generic algorithm for solving linear complementarity problems resulting from the finite…

Computational Finance · Quantitative Finance 2012-06-19 Christoph Reisinger , Jan Hendrik Witte

Recoverable robust optimization is a multi-stage approach, where it is possible to adjust a first-stage solution after the uncertain cost scenario is revealed. We analyze this approach for a class of selection problems. The aim is to choose…

Optimization and Control · Mathematics 2021-02-22 Marc Goerigk , Stefan Lendl , Lasse Wulf

Econometric inference allows an analyst to back out the values of agents in a mechanism from the rules of the mechanism and bids of the agents. This paper gives an algorithm to solve the problem of inferring the values of agents in a…

Computer Science and Game Theory · Computer Science 2020-03-31 Jason Hartline , Aleck Johnsen , Denis Nekipelov , Zihe Wang

We consider a dynamic pricing problem under unknown demand models. In this problem a seller offers prices to a stream of customers and observes either success or failure in each sale attempt. The underlying demand model is unknown to the…

Machine Learning · Computer Science 2012-10-30 Pouya Tehrani , Yixuan Zhai , Qing Zhao

Bipartite b-matching, where agents on one side of a market are matched to one or more agents or items on the other, is a classical model that is used in myriad application areas such as healthcare, advertising, education, and general…

Artificial Intelligence · Computer Science 2020-02-13 Saba Ahmadi , Faez Ahmed , John P. Dickerson , Mark Fuge , Samir Khuller

We study the power of polynomial-time truthful mechanisms comparing to polynomial time (non-truthful) algorithms. We show that there is a setting in which deterministic polynomial-time truthful mechanisms cannot guarantee a bounded…

Computer Science and Game Theory · Computer Science 2009-08-24 Shahar Dobzinski

Participatory budgeting is a method of collectively understanding and addressing spending priorities where citizens vote on how a budget is spent, it is regularly run to improve the fairness of the distribution of public funds.…

Multiagent Systems · Computer Science 2025-07-24 Hugh Adams , Srijoni Majumdar , Evangelos Pournaras

A set of objects is to be divided fairly among agents with different tastes, modeled by additive utility-functions. If we consider the objects as indivisible, many instances of the decision problem: ``Is there a fair division of the objects…

Computer Science and Game Theory · Computer Science 2025-07-03 Samuel Bismuth , Ivan Bliznets , Erel Segal-Halevi

Rating systems play a vital role in the exponential growth of service-oriented markets. As highly rated online services usually receive substantial revenue in the markets, malicious sellers seek to boost their service evaluation by…

Computer Science and Game Theory · Computer Science 2022-03-01 Xin Zhou , Shigeo Matsubara , Yuan Liu , Qidong Liu

Voting systems typically treat all voters equally. We argue that perhaps they should not: Voters who have supported good choices in the past should be given higher weight than voters who have supported bad ones. To develop a formal…

Computer Science and Game Theory · Computer Science 2017-03-16 Nika Haghtalab , Ritesh Noothigattu , Ariel D. Procaccia

We introduce a new approach for the numerical pricing of American options. The main idea is to choose a finite number of suitable excessive functions (randomly) and to find the smallest majorant of the gain function in the span of these…

Computational Finance · Quantitative Finance 2013-10-17 Sören Christensen

In this survey, we review the literature investigating participatory budgeting as a social choice problem. Participatory Budgeting (PB) is a democratic process in which citizens are asked to vote on how to allocate a given amount of public…

Computer Science and Game Theory · Computer Science 2025-03-14 Simon Rey , Felicia Schmidt , Jan Maly

We survey the design of elections that are resilient to attempted interference by third parties. For example, suppose votes have been cast in an election between two candidates, and then each vote is randomly changed with a small…

Probability · Mathematics 2021-07-13 Steven Heilman

Preference elicitation is a central problem in AI, and has received significant attention in single-agent settings. It is also a key problem in multiagent systems, but has received little attention here so far. In this setting, the agents…

Computer Science and Game Theory · Computer Science 2007-05-23 Vincent Conitzer , Tuomas Sandholm