English
Related papers

Related papers: Correlated Equilibria in Competitive Staff Selecti…

200 papers

In this paper, the problem of finding a Nash equilibrium of a multi-player game is considered. The players are only aware of their own cost functions as well as the action space of all players. We develop a relatively fast algorithm within…

Systems and Control · Computer Science 2017-05-09 Farzad Salehisadaghiani , Lacra Pavel

In this paper we present a novel generic mapping between Graphical Games and Markov Random Fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Thus, the problem of deciding whether a…

Computer Science and Game Theory · Computer Science 2007-05-23 Constantinos Daskalakis

This paper considers a class of noncooperative games in which the feasible decision sets of all players are coupled together by a coupled inequality constraint. Adopting the variational inequality formulation of the game, we first introduce…

Computer Science and Game Theory · Computer Science 2024-02-13 Huaqing Li , Liang Ran , Lifeng Zheng , Zhe Li , Jinhui Hu , Jun Li , Tingwen Huang

It is well known that a non-cooperative game may have multiple equilibria. In this paper we consider the efficiency of games, measured by the ratio between the aggregate payoff over all Nash equilibria and that over all admissible controls.…

Computer Science and Game Theory · Computer Science 2025-08-20 Jianfeng Zhang

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

Games with incomplete preferences are an important model for studying rational decision-making in scenarios where players face incomplete information about their preferences and must contend with incomparable outcomes. We study the problem…

Computer Science and Game Theory · Computer Science 2024-08-13 Abhishek N. Kulkarni , Jie Fu , Ufuk Topcu

Learning problems commonly exhibit an interesting feedback mechanism wherein the population data reacts to competing decision makers' actions. This paper formulates a new game theoretic framework for this phenomenon, called "multi-player…

Computer Science and Game Theory · Computer Science 2022-04-08 Adhyyan Narang , Evan Faulkner , Dmitriy Drusvyatskiy , Maryam Fazel , Lillian J. Ratliff

We study nonzero-sum stochastic switching games. Two players compete for market dominance through controlling (via timing options) the discrete-state market regime $M$. Switching decisions are driven by a continuous stochastic factor $X$…

General Economics · Economics 2018-07-23 Liangchen Li , Michael Ludkovski

This article is related to risk-sensitive nonzero-sum stochastic differential games in the Markovian framework. This game takes into account the attitudes of the players toward risk and the utility is of exponential form. We show the…

Optimization and Control · Mathematics 2014-12-04 Said Hamadène , Rui Mu

Adversarial training is a standard technique for training adversarially robust models. In this paper, we study adversarial training as an alternating best-response strategy in a 2-player zero-sum game. We prove that even in a simple…

Machine Learning · Computer Science 2023-03-01 Maria-Florina Balcan , Rattana Pukdee , Pradeep Ravikumar , Hongyang Zhang

We develop a probabilistic approach to continuous-time finite state mean field games. Based on an alternative description of continuous-time Markov chain by means of semimartingale and the weak formulation of stochastic optimal control, our…

Probability · Mathematics 2018-08-24 Rene Carmona , Peiqi Wang

We study pure-strategy Nash equilibria in multi-player concurrent deterministic games, for a variety of preference relations. We provide a novel construction, called the suspect game, which transforms a multi-player concurrent game into a…

Logic in Computer Science · Computer Science 2017-01-11 Patricia Bouyer , Romain Brenguier , Nicolas Markey , Michael Ummels

In this article we consider zero and non-zero sum risk-sensitive average criterion games for semi-Markov processes with a finite state space. For the zero-sum case, under suitable assumptions we show that the game has a value. We also…

Optimization and Control · Mathematics 2021-06-10 Arnab Bhabak , Subhamay Saha

Strategic interactions can be represented more concisely, and analyzed and solved more efficiently, if we are aware of the symmetries within the multiagent system. Symmetries also have conceptual implications, for example for equilibrium…

Computer Science and Game Theory · Computer Science 2025-03-03 Emanuel Tewolde , Brian Hu Zhang , Caspar Oesterheld , Tuomas Sandholm , Vincent Conitzer

The Nash equilibrium problem is a widely used tool to model non-cooperative games. Many solution methods have been proposed in the literature to compute solutions of Nash equilibrium problems with continuous strategy sets, but, besides some…

Optimization and Control · Mathematics 2015-12-03 Simone Sagratella

Learning in games provides a powerful framework to design control policies for self-interested agents that may be coupled through their dynamics, costs, or constraints. We consider the case where the dynamics of the coupled system can be…

Systems and Control · Electrical Eng. & Systems 2024-09-18 Mostafa M. Shibl , Vijay Gupta

Mixed extension has played an important role in game theory, especially in the proof of the existence of Nash equilibria in strategic form games. Mixed extension can be regarded as continuous relaxation of a strategic form game. Recently,…

Physics and Society · Physics 2025-05-05 Masahiko Ueda , Ayaka Fujita

The model of congestion games is widely used to analyze games related to traffic and communication. A central property of these games is that they are potential games and hence posses a pure Nash equilibrium. In reality it is often the case…

Computer Science and Game Theory · Computer Science 2011-11-17 Sergey Kuniavsky , Rann Smorodinsky

In competitive resource allocation, a central coordinator may seek to gain an advantage not by directly controlling subordinate agents, but by strategically manipulating the information they receive. We study this problem within the…

Computer Science and Game Theory · Computer Science 2026-05-11 Gilberto Diaz-Garcia , Keith Paarporn , Jason R. Marden

Due to the lack of coordination, it is unlikely that the selfish players of a strategic game reach a socially good state. A possible way to cope with selfishness is to compute a desired outcome (if it is tractable) and impose it. However…

Computer Science and Game Theory · Computer Science 2010-12-20 Bruno Escoffier , Laurent Gourvès , Jérôme Monnot
‹ Prev 1 8 9 10 Next ›