English
Related papers

Related papers: Submodular Participatory Budgeting

200 papers

Human cooperation depends on how accurately we infer others' motives--how much they value fairness, generosity, or self-interest from the choices they make. We model that process in binary dictator games, which isolate moral trade-offs…

Neurons and Cognition · Quantitative Biology 2025-11-12 Gregory Stanley , Jun Zhang , Rick Lewis

We study mechanism design for combinatorial cost sharing. Imagine that multiple items or services are available to be shared among a set of interested agents. The outcome of a mechanism in this setting consists of an assignment, determining…

Computer Science and Game Theory · Computer Science 2019-10-16 Georgios Birmpas , Evangelos Markakis , Guido Schäfer

In this paper, we study a new stochastic submodular maximization problem with state-dependent costs and rejections. The input of our problem is a budget constraint $B$, and a set of items whose states (i.e., the marginal contribution and…

Data Structures and Algorithms · Computer Science 2021-11-12 Shaojie Tang

Reaching some form of consensus is often necessary for autonomous agents that want to coordinate their actions or otherwise engage in joint activities. One way to reach a consensus is by aggregating individual information, such as…

Multiagent Systems · Computer Science 2016-07-13 Marija Slavkovik

Understanding political phenomena requires measuring the political preferences of society. We introduce a model based on mixtures of spatial voting models that infers the underlying distribution of political preferences of voters with only…

Computers and Society · Computer Science 2016-10-27 Alison Nahm , Alex Pentland , Peter Krafft

Decision theory has become widely accepted in the AI community as a useful framework for planning and decision making. Applying the framework typically requires elicitation of some form of probability and utility information. While much…

Artificial Intelligence · Computer Science 2013-02-08 Vu A. Ha , Peter Haddawy

Submodular functions, as well as the sub-class of decomposable submodular functions, and their optimization appear in a wide range of applications in machine learning, recommendation systems, and welfare maximization. However, optimization…

Data Structures and Algorithms · Computer Science 2024-06-04 Akbar Rafiey

Submodularity is an important concept in integer and combinatorial optimization. A classical submodular set function models the utility of selecting homogenous items from a single ground set, and such selections can be represented by binary…

Optimization and Control · Mathematics 2023-04-06 Simge Küçükyavuz , Qimeng Yu

We study the problem of a budget limited buyer who wants to buy a set of items, each from a different seller, to maximize her value. The budget feasible mechanism design problem aims to design a mechanism which incentivizes the sellers to…

Computer Science and Game Theory · Computer Science 2017-04-03 Pooya Jalaly , Eva Tardos

Submodular function maximization is a fundamental combinatorial optimization problem with plenty of applications -- including data summarization, influence maximization, and recommendation. In many of these problems, the goal is to find a…

Data Structures and Algorithms · Computer Science 2023-09-04 Yanhao Wang , Yuchen Li , Francesco Bonchi , Ying Wang

In many naturally occurring optimization problems one needs to ensure that the definition of the optimization problem lends itself to solutions that are tractable to compute. In cases where exact solutions cannot be computed tractably, it…

Machine Learning · Computer Science 2015-05-08 Bharath Sankaran , Marjan Ghazvininejad , Xinran He , David Kale , Liron Cohen

In recent years, research in Participatory Budgeting (PB) has put a greater emphasis on rules satisfying notions of fairness and proportionality, with the Method of Equal Shares (MES) being a prominent example. However, proportionality can…

Computer Science and Game Theory · Computer Science 2025-11-27 Anton Baychkov , Markus Brill , Jannik Peters

We study multiwinner elections with approval-based preferences. An instance of a multiwinner election consists of a set of alternatives, a population of voters---each voter approves a subset of alternatives, and the desired committee size…

Computer Science and Game Theory · Computer Science 2019-10-15 Piotr Skowron

We study a participatory budgeting problem, where a set of strategic agents wish to split a divisible budget among different projects, by aggregating their proposals on a single division. Unfortunately, the straight-forward rule that…

Computer Science and Game Theory · Computer Science 2022-03-21 Ioannis Caragiannis , George Christodoulou , Nicos Protopapas

The econometric literature on treatment-effects typically takes functionals of outcome-distributions as `social welfare' and ignores program-impacts on unobserved utilities. We show how to incorporate aggregate utility within econometric…

Econometrics · Economics 2022-11-21 Debopam Bhattacharya , Tatiana Komarova

Voting is a very general method of preference aggregation. A voting rule takes as input every voter's vote (typically, a ranking of the alternatives), and produces as output either just the winning alternative or a ranking of the…

Computer Science and Game Theory · Computer Science 2012-07-09 Vincent Conitzer , Tuomas Sandholm

The relationship of policy choice by majority voting and by maximization of utilitarian welfare has long been discussed. I consider choice between a status quo and a proposed policy when persons have interpersonally comparable cardinal…

Theoretical Economics · Economics 2024-12-30 Charles F. Manski

The public goods game is a broadly used paradigm for studying the evolution of cooperation in structured populations. According to the basic assumption, the interaction graph determines the connections of a player where the focal actor…

Physics and Society · Physics 2024-04-24 Ju Han , Xiaojie Chen , Attila Szolnoki

The optimal pricing problem is a fundamental problem that arises in combinatorial auctions. Suppose that there is one seller who has indivisible items and multiple buyers who want to purchase a combination of the items. The seller wants to…

Computer Science and Game Theory · Computer Science 2016-11-24 Takanori Maehara , Yasushi Kawase , Hanna Sumita , Katsuya Tono , Ken-ichi Kawarabayashi

In this paper, we study the classic submodular maximization problem subject to a group equality constraint under both non-adaptive and adaptive settings. It has been shown that the utility function of many machine learning applications,…

Machine Learning · Computer Science 2023-08-30 Shaojie Tang , Jing Yuan