English
Related papers

Related papers: Interdependent Public Projects

200 papers

Finding an envy-free allocation of indivisible resources to agents is a central task in many multiagent systems. Often, non-trivial envy-free allocations do not exist, and, when they do, finding them can be computationally hard. Classical…

Computer Science and Game Theory · Computer Science 2020-11-24 Robert Bredereck , Andrzej Kaczmarczyk , Rolf Niedermeier

Fairly dividing a set of indivisible resources to a set of agents is of utmost importance in some applications. However, after an allocation has been implemented the preferences of agents might change and envy might arise. We study the…

Computer Science and Game Theory · Computer Science 2022-02-04 Niclas Boehmer , Robert Bredereck , Klaus Heeger , Dušan Knop , Junjie Luo

We explore the effects of social influence in a simple market model in which a large number of agents face a binary choice: 'to buy/not to buy' a single unit of a product at a price posted by a single seller (the monopoly case). We consider…

Disordered Systems and Neural Networks · Physics 2008-12-02 Jean-Pierre Nadal , Denis Phan , Mirta B. Gordon , Jean Vannimenus

In the Submodular Welfare Maximization (SWM) problem, the input consists of a set of $n$ items, each of which must be allocated to one of $m$ agents. Each agent $\ell$ has a valuation function $v_\ell$, where $v_\ell(S)$ denotes the welfare…

Data Structures and Algorithms · Computer Science 2017-12-18 Nitish Korula , Vahab Mirrokni , Morteza Zadimoghaddam

Large language model (LLM) agents with extended autonomy unlock new capabilities, but also introduce heightened challenges for LLM safety. In particular, an LLM agent may pursue objectives that deviate from human values and ethical norms, a…

Computation and Language · Computer Science 2026-01-27 Chen Chen , Kim Young Il , Yuan Yang , Wenhao Su , Yilin Zhang , Xueluan Gong , Qian Wang , Yongsen Zheng , Ziyao Liu , Kwok-Yan Lam

The auction of a single indivisible item is one of the most celebrated problems in mechanism design with transfers. Despite its simplicity, it provides arguably the cleanest and most insightful results in the literature. When the…

Computer Science and Game Theory · Computer Science 2023-07-04 Rangeet Bhattacharyya , Parvik Dave , Palash Dey , Swaprava Nath

A set of agents has to make a decision about the provision of a public good and its financing. Agents have heterogeneous values for the public good and each agent's value is private information. An agenda-setter has the right to make a…

Theoretical Economics · Economics 2025-04-16 Giovanni Valvassori Bolgè

We study no-money mechanisms for allocating indivisible items to strategic agents with additive preferences under a stochastic model. In this model, items' values are drawn from an underlying distribution and mechanisms are evaluated with…

Computer Science and Game Theory · Computer Science 2026-02-16 Daniel Halpern , Alexandros Psomas , Shirley Zhang

Variable selection in high-dimensional space characterizes many contemporary problems in scientific discovery and decision making. Many frequently-used techniques are based on independence screening; examples include correlation ranking…

Methodology · Statistics 2008-12-18 Jianqing Fan , Richard Samworth , Yichao Wu

Estimating causal effects in the presence of spillover among individuals embedded within a social network is often challenging with missing information. The spillover effect is the effect of an intervention if a participant is not exposed…

In contemporary digital markets, personal data often reveals not just isolated traits, but complex, intersectional identities based on combinations of race, gender, disability, and other protected characteristics. This exposure generates a…

Information Theory · Computer Science 2025-07-22 Eduardo C. Garrido-Merchán

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

The stochastic actor oriented model (SAOM) is a method for modelling social interactions and social behaviour over time. It can be used to model drivers of dynamic interactions using both exogenous covariates and endogenous network…

Methodology · Statistics 2024-02-02 Giacomo Ceoldo , Tom A. B. Snijders , Ernst C. Wit

We study the problem of social welfare maximization in bilateral trade, where two agents, a buyer and a seller, trade an indivisible item. We consider arguably the simplest form of mechanisms -- the fixed-price mechanisms, where the…

Computer Science and Game Theory · Computer Science 2023-06-21 Yang Cai , Jinzhao Wu

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…

Computer Science and Game Theory · Computer Science 2011-04-19 Shaddin Dughmi , Tim Roughgarden , Qiqi Yan

We examine the problem of assigning plots of land to prospective buyers who prefer living next to their friends. They care not only about the plot they receive, but also about their neighbors. This externality results in a highly…

Computer Science and Game Theory · Computer Science 2020-03-16 Edith Elkind , Neel Patel , Alan Tsang , Yair Zick

We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and the seller must make the allocation and payment decisions…

Computer Science and Game Theory · Computer Science 2009-05-22 Moshe Babaioff , Liad Blumrosen , Aaron L. Roth

Multi-Agent Reinforcement Learning (MARL) has become a promising solution for constructing a multi-agent autonomous driving system (MADS) in complex and dense scenarios. But most methods consider agents acting selfishly, which leads to…

Robotics · Computer Science 2023-10-06 Jintao Xue , Dongkun Zhang , Rong Xiong , Yue Wang , Eryun Liu

Randomized experiments can be susceptible to selection bias due to potential non-compliance by the participants. While much of the existing work has studied compliance as a static behavior, we propose a game-theoretic model to study…

Machine Learning · Computer Science 2021-07-29 Daniel Ngo , Logan Stapleton , Vasilis Syrgkanis , Zhiwei Steven Wu

We introduce a nonparametric graphical model for discrete node variables based on additive conditional independence. Additive conditional independence is a three way statistical relation that shares similar properties with conditional…

Methodology · Statistics 2021-12-30 Jun Tao , Bing Li , Lingzhou Xue