English
Related papers

Related papers: Smooth Inequalities and Equilibrium Inefficiency i…

200 papers

Concurrent stochastic games (CSGs) are an ideal formalism for modelling probabilistic systems that feature multiple players or components with distinct objectives making concurrent, rational decisions. Examples include communication or…

Logic in Computer Science · Computer Science 2020-07-27 Marta Kwiatkowska , Gethin Norman , David Parker , Gabriel Santos

We study a game with \emph{strategic} vendors who own multiple items and a single buyer with a submodular valuation function. The goal of the vendors is to maximize their revenue via pricing of the items, given that the buyer will buy the…

Computer Science and Game Theory · Computer Science 2014-08-04 Omer Lev , Joel Oren , Craig Boutilier , Jeffery S. Rosenschein

In this study, we formulate positive and negative externalities caused by changes in the supply of shared vehicles as ride sharing games. The study aims to understand the price of anarchy (PoA) and its improvement via a coordination…

Computer Science and Game Theory · Computer Science 2016-04-05 Tatsuya Iwase , Takahiro Shiga

In this paper we introduce a capacity allocation game which models the problem of maximizing network utility from the perspective of distributed noncooperative agents. Motivated by the idea of self-managed networks, in the developed…

Computer Science and Game Theory · Computer Science 2013-07-23 Dariusz Gcasior , Maciej Drwal

Consider a problem in which $n$ jobs that are classified into $k$ types arrive over time at their release times and are to be scheduled on a single machine so as to minimize the maximum flow time. The machine requires a setup taking $s$…

Data Structures and Algorithms · Computer Science 2017-09-19 Alexander Mäcker , Manuel Malatyali , Friedhelm Meyer auf der Heide , Sören Riechers

We study the global convergence of policy optimization for finding the Nash equilibria (NE) in zero-sum linear quadratic (LQ) games. To this end, we first investigate the landscape of LQ games, viewing it as a nonconvex-nonconcave…

Machine Learning · Computer Science 2021-02-12 Kaiqing Zhang , Zhuoran Yang , Tamer Başar

Two important metrics for measuring the quality of routing paths are the maximum edge congestion $C$ and maximum path length $D$. Here, we study bicriteria in routing games where each player $i$ selfishly selects a path that simultaneously…

Computer Science and Game Theory · Computer Science 2008-02-01 Costas Busch , Rajgopal Kannan

We study a signaling game between two firms competing to have their product chosen by a principal. The products have qualities drawn i.i.d. from a common prior. The principal aims to choose the better product, but the quality of a product…

Computer Science and Game Theory · Computer Science 2021-10-22 Siddhartha Banerjee , David Kempe , Robert Kleinberg

In this paper we present a new competitive packet routing model with edge priorities. We consider players that route selfishly through a network over time and try to reach their destinations as fast as possible. If the number of players who…

Computer Science and Game Theory · Computer Science 2018-08-22 Robert Scheffler , Martin Strehler , Laura Vargas Koch

We study Nash equilibria and the price of anarchy in the classic model of Network Creation Games introduced by Fabrikant, Luthra, Maneva, Papadimitriou and Shenker in 2003. This is a selfish network creation model where players correspond…

Computer Science and Game Theory · Computer Science 2019-09-24 Carme Àlvarez , Arnau Messegué

Residential segregation in metropolitan areas is a phenomenon that can be observed all over the world. Recently, this was investigated via game-theoretic models. There, selfish agents of two types are equipped with a monotone utility…

Computer Science and Game Theory · Computer Science 2022-05-11 Davide Bilò , Vittorio Bilò , Pascal Lenzner , Louise Molitor

Consider an important meeting to be held in a team-based organization. Taking availability constraints into account, an online scheduling poll is being used in order to decide upon the exact time of the meeting. Decisions are to be taken…

Computer Science and Game Theory · Computer Science 2016-11-29 Robert Bredereck , Jiehua Chen , Rolf Niedermeier , Svetlana Obraztsova , Nimrod Talmon

We consider the problem of designing distribution rules to share "welfare" (cost or revenue) among individually strategic agents. There are many known distribution rules that guarantee the existence of a (pure) Nash equilibrium in this…

Computer Science and Game Theory · Computer Science 2014-02-18 Ragavendran Gopalakrishnan , Jason R. Marden , Adam Wierman

Routing games are amongst the most studied classes of games. Their two most well-known properties are that learning dynamics converge to equilibria and that all equilibria are approximately optimal. In this work, we perform a stress test…

Computer Science and Game Theory · Computer Science 2022-01-28 Thiparat Chotibut , Fryderyk Falniowski , Michał Misiurewicz , Georgios Piliouras

This paper examines public goods and evaluates the mechanism through the game theory. Public goods are characterized by nonexclusivity and nonrivalry and this creates fundamental challenges for allocation. We analyze why competitive markets…

Theoretical Economics · Economics 2025-11-20 Yash Prajapati

In two-player zero-sum stochastic games, where two competing players make decisions under uncertainty, a pair of optimal strategies is traditionally described by Nash equilibrium and computed under the assumption that the players have…

Optimization and Control · Mathematics 2019-07-30 Yagiz Savas , Mohamadreza Ahmadi , Takashi Tanaka , Ufuk Topcu

Logit-response dynamics (Alos-Ferrer and Netzer, Games and Economic Behavior 2010) are a rich and natural class of noisy best-response dynamics. In this work we revise the price of anarchy and the price of stability by considering the…

Computer Science and Game Theory · Computer Science 2015-12-15 Paolo Penna

Schelling games model the wide-spread phenomenon of residential segregation in metropolitan areas from a game-theoretic point of view. In these games agents of different types each strategically select a node on a given graph that models…

Computer Science and Game Theory · Computer Science 2023-02-24 Tobias Friedrich , Pascal Lenzner , Louise Molitor , Lars Seifert

In this paper, we study a variant of hedonic games, called \textsc{Seat Arrangement}. The model is defined by a bijection from agents with preferences for each other to vertices in a graph $G$. The utility of an agent depends on the…

Computer Science and Game Theory · Computer Science 2025-07-30 Hans L. Bodlaender , Tesshu Hanaka , Lars Jaffke , Hirotaka Ono , Yota Otachi , Tom C. van der Zanden

We investigate a spectrum oligopoly market where primaries lease their channels to secondaries in lieu of financial remuneration. Transmission quality of a channel evolves randomly. Each primary has to select the price it would quote…

Computer Science and Game Theory · Computer Science 2015-05-22 Arnob Ghosh , Saswati Sarkar