English
Related papers

Related papers: Single-Peaked Jump Schelling Games

200 papers

We introduce natural strategic games on graphs, which capture the idea of coordination in a local setting. We study the existence of equilibria that are resilient to coalitional deviations of unbounded and bounded size (i.e., strong…

Computer Science and Game Theory · Computer Science 2016-10-19 Krzysztof R. Apt , Bart de Keijzer , Mona Rahn , Guido Schaefer , Sunil Simon

We study a non-cooperative two-sided facility location game in which facilities and clients behave strategically. This is in contrast to many other facility location games in which clients simply visit their closest facility. Facility…

Computer Science and Game Theory · Computer Science 2024-06-14 Simon Krogmann , Pascal Lenzner , Alexander Skopalik

A recurring theme in recent computer science literature is that proper design of signaling schemes is a crucial aspect of effective mechanisms aiming to optimize social welfare or revenue. One of the research endeavors of this line of work…

Computer Science and Game Theory · Computer Science 2015-07-07 Moran Feldman , Moshe Tennenholtz , Omri Weinstein

The framework of multi-agent learning explores the dynamics of how individual agent strategies evolve in response to the evolving strategies of other agents. Of particular interest is whether or not agent strategies converge to well known…

Computer Science and Game Theory · Computer Science 2023-11-21 Sarah A. Toonsi , Jeff S. Shamma

We propose a model of discrete time dynamic congestion games with atomic players and a single source-destination pair. The latencies of edges are composed by free-flow transit times and possible queuing time due to capacity constraints. We…

Computer Science and Game Theory · Computer Science 2019-01-03 Marco Scarsini , Marc Schröder , Tristan Tomala

The behaviour of multi-agent learning in competitive settings is often considered under the restrictive assumption of a zero-sum game. Only under this strict requirement is the behaviour of learning well understood; beyond this, learning…

Computer Science and Game Theory · Computer Science 2023-07-27 Aamal Hussain , Francesco Belardinelli , Georgios Piliouras

We introduce a simple stochastic dynamics for game theory. It assumes ``local'' rationality in the sense that any player climbs the gradient of his utility function in the presence of a stochastic force which represents deviation from…

Statistical Mechanics · Physics 2008-11-23 Matteo Marsili , Yi-Cheng Zhang

In a network game, players interact over a network and the utility of each player depends on his own action and on an aggregate of his neighbours' actions. Many real world networks of interest are asymmetric and involve a large number of…

Computer Science and Game Theory · Computer Science 2025-08-12 Kiran Rokade , Adit Jain , Francesca Parise , Vikram Krishnamurthy , Eva Tardos

We consider the dynamic behavior of several variants of the Network Creation Game, introduced by Fabrikant et al. [PODC'03]. Equilibrium networks in these models have desirable properties like low social cost and small diameter, which makes…

Computer Science and Game Theory · Computer Science 2013-05-29 Bernd Kawald , Pascal Lenzner

During a pandemic people have to find a trade-off between meeting others and staying safely at home. While meeting others is pleasant, it also increases the risk of infection. We consider this dilemma by introducing a game-theoretic network…

Computer Science and Game Theory · Computer Science 2022-04-26 Tobias Friedrich , Hans Gawendowicz , Pascal Lenzner , Anna Melnichenko

A matching game is a cooperative profit game defined on an edge-weighted graph, where the players are the vertices and the profit of a coalition is the maximum weight of matchings in the subgraph induced by the coalition. A population…

Computer Science and Game Theory · Computer Science 2021-05-04 Han Xiao , Qizhi Fang

Many distributed systems can be modeled as network games: a collection of selfish players that communicate in order to maximize their individual utilities. The performance of such games can be evaluated through the costs of the system…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-05-18 Petr Kuznetsov , Stefan Schmid

We consider a model of nomadic agents exploring and competing for time-varying location-specific resources, arising in crowdsourced transportation services, online communities, and in traditional location based economic activity. This model…

Computer Science and Game Theory · Computer Science 2016-02-23 Pu Yang , Krishnamurthy Iyer , Peter Frazier

In this paper, we present and analyze the properties of a new class of games - the spatial congestion game (SCG), which is a generalization of the classical congestion game (CG). In a classical congestion game, multiple users share the same…

Computer Science and Game Theory · Computer Science 2010-12-13 Sahand Ahmad , Cem Tekin , Mingyan Liu , Richard Southwell , Jianwei Huang

We study stable matching problems in networks where players are embedded in a social context, and may incorporate friendship relations or altruism into their decisions. Each player is a node in a social network and strives to form a good…

Computer Science and Game Theory · Computer Science 2012-04-27 Elliot Anshelevich , Onkar Bhardwaj , Martin Hoefer

In multi-rate IEEE 802.11 WLANs, the traditional user association based on the strongest received signal and the well known anomaly of the MAC protocol can lead to overloaded Access Points (APs), and poor or heterogeneous performance. Our…

Computer Science and Game Theory · Computer Science 2016-05-03 Mikael Touati , Rachid El-Azouzi , Marceau Coupechoux , Eitan Altmanand Jean-Marc Kelif

This paper develops a game-theoretic model and an agent-based model to study group formation driven by resource pooling, spatial cohesion, and heterogeneity. We focus on cross-sector partnerships (CSPs) involving public, private, and…

Computer Science and Game Theory · Computer Science 2025-09-24 Chenlan Wang , Jimin Han , Diana Jue-Rajasingh

This paper studies the finite-time horizon Markov games where the agents' dynamics are decoupled but the rewards can possibly be coupled across agents. The policy class is restricted to local policies where agents make decisions using their…

Computer Science and Game Theory · Computer Science 2023-04-11 Runyu Zhang , Yuyang Zhang , Rohit Konda , Bryce Ferguson , Jason Marden , Na Li

Interactions among selfish users sharing a common transmission channel can be modeled as a non-cooperative game using the game theory framework. When selfish users choose their transmission probabilities independently without any…

Computer Science and Game Theory · Computer Science 2009-05-31 Jaeok Park , Mihaela van der Schaar

How is efficiency affected when demand excesses over supply are signalled through waiting in queues? We consider a class of congestion games with a nonatomic set of players of a constant mass, based on a formulation of generic linear…

Computer Science and Game Theory · Computer Science 2020-11-18 Costas Courcoubetis , Antonis Dimakis