English
Related papers

Related papers: Optimal Utility Design with Arbitrary Information …

200 papers

We study the optimal pricing strategies of a monopolist selling a divisible good (service) to consumers that are embedded in a social network. A key feature of our model is that consumers experience a (positive) local network effect. In…

Computer Science and Game Theory · Computer Science 2011-01-31 Ozan Candogan , Kostas Bimpikis , Asuman Ozdaglar

Algorithmic-matching sites offer users access to an unprecedented number of potential mates. However, they also pose a principal-agent problem with a potential moral hazard. The agent's interest is to maximize usage of the Web site, while…

Computer Science and Game Theory · Computer Science 2019-02-19 Andrés Abeliuk , Khaled Elbassioni , Talal Rahwan , Manuel Cebrian , Iyad Rahwan

Given a set of $m$ agents and a set of $n$ items, where agent $A$ has utility $u_{A,i}$ for item $i$, our goal is to allocate items to agents to maximize fairness. Specifically, the utility of an agent is the sum of its utilities for items…

Data Structures and Algorithms · Computer Science 2009-01-05 Deeparnab Chakrabarty , Julia Chuzhoy , Sanjeev Khanna

When many independent users try to route traffic through a network, the flow can easily become suboptimal as a consequence of congestion of the most efficient paths. The degree of this suboptimality is quantified by the so-called "price of…

Disordered Systems and Neural Networks · Physics 2015-05-19 Brian Skinner

The robustness of multiagent systems can be affected by mistakes or behavioral biases (e.g., risk-aversion, altruism, toll-sensitivity), with some agents playing the "wrong game." This can change the set of equilibria, and may in turn harm…

Computer Science and Game Theory · Computer Science 2018-03-14 Reshef Meir , David Parkes

A fundamental component of the game theoretic approach to distributed control is the design of local utility functions.Relative to resource allocation problems that are additive over the resources, Part I showed how to design local…

Computer Science and Game Theory · Computer Science 2021-01-14 Dario Paccagnan , Jason R. Marden

We study the principal-agent problem with a third party that we call social planner, whose responsibility is to reconcile the conflicts of interest between the two players and induce socially optimal outcome in terms of some given social…

Computer Science and Game Theory · Computer Science 2024-11-07 Shiyun Lin , Zhihua Zhang

The modernization of the power system introduces technologies that may improve the system's efficiency by enhancing the capabilities of users. Despite their potential benefits, such technologies can have a negative impact. This subject has…

Computer Science and Game Theory · Computer Science 2019-06-28 Carlos Barreto , Eduardo Mojica-Nava , Nicanor Quijano

A basic lesson from game theory is that strategic behavior often renders the equilibrium outcome inefficient. The recent literature of information design -- a.k.a. signaling or persuasion -- looks to improve equilibria by providing…

Computer Science and Game Theory · Computer Science 2020-09-29 James Nachbar , Haifeng Xu

We study the optimal design of electricity contracts among a population of consumers with different needs. This question is tackled within the framework of Principal-Agent problems in presence of adverse selection. The particular features…

Optimization and Control · Mathematics 2019-09-17 Clémence Alasseur , Ivar Ekeland , Romuald Elie , Nicolás Hernández Santibáñez , Dylan Possamaï

This paper studies a joint design problem where a seller can design both the signal structures for the agents to learn their values, and the allocation and payment rules for selling the item. In his seminal work, Myerson (1981) shows how to…

Computer Science and Game Theory · Computer Science 2024-03-14 Yang Cai , Yingkai Li , Jinzhao Wu

The emergence of new communication technologies allows us to expand our understanding of distributed control and consider collaborative decision-making paradigms. With collaborative algorithms, certain local decision-making entities (or…

Computer Science and Game Theory · Computer Science 2023-08-17 Bryce L. Ferguson , Dario Paccagnan , Bary S. R. Pradelski , Jason R. Marden

We consider a routing game among non-atomic agents where link latency functions are conditional on an uncertain state of the network. The agents have the same prior belief about the state, but only a fixed fraction receive private route…

Computer Science and Game Theory · Computer Science 2021-08-31 Yixian Zhu , Ketan Savla

In this paper, we analyse how a peer-to-peer sharing platform should price its service (when imagined as an excludable public good) to maximize profit, when each user's participation adds value to the platform service by creating a positive…

Computer Science and Game Theory · Computer Science 2020-09-29 Yunpeng Li , Costas Courcoubetis , Lingjie Duan , Richard Weber

Mechanisms such as auctions and pricing schemes are utilized to design strategic (noncooperative) games for networked systems. Although the participating players are selfish, these mechanisms ensure that the game outcome is optimal with…

Computer Science and Game Theory · Computer Science 2010-09-03 Tansu Alpcan , Holger Boche , Siddharth Naik

We consider an atomic congestion game in which each player $i$ participates in the game with an exogenous and known probability $p_{i}\in(0,1]$, independently of everybody else, or stays out and incurs no cost. We compute the parameterized…

Computer Science and Game Theory · Computer Science 2024-08-13 Roberto Cominetti , Marco Scarsini , Marc Schröder , Nicolás Stier-Moses

Game-theoretic models relevant for computer science applications usually feature a large number of players. The goal of this paper is to develop an analytical framework for bounding the price of anarchy in such models. We demonstrate the…

Computer Science and Game Theory · Computer Science 2015-04-06 Michal Feldman , Nicole Immorlica , Brendan Lucier , Tim Roughgarden , Vasilis Syrgkanis

In this paper, we consider a general distributed system with multiple agents who select and then implement actions in the system. The system has an operator with a centralized objective. The agents, on the other hand, are selfinterested and…

Computer Science and Game Theory · Computer Science 2020-01-15 Donya Ghavidel , Pratyush Chakraborty , Enrique Baeyens , Vijay Gupta , Pramod P. Khargonekar

We study the problem of locating a single obnoxious facility on the normalized line segment $[0,1]$ with strategic agents from a mechanism design perspective. Each agent has a preference for the undesirable location of the facility and…

Computer Science and Game Theory · Computer Science 2025-12-23 Hau Chan , Jianan Lin , Chenhao Wang

Crowdsourcing services, such as Waze, leverage a mass of mobile users to learn massive point-of-interest (PoI) information while traveling and share it as a public good. Given that crowdsourced users mind their travel costs and possess…

Computer Science and Game Theory · Computer Science 2025-06-02 Songhua Li , Lingjie Duan