Related papers: Malicious Bayesian Congestion Games
Congestion game is a widely used model for modern networked applications. A central issue in such applications is that the selfish behavior of the participants may result in resource overloading and negative externalities for the system…
At a mixed Nash equilibrium, the payoff of a player does not depend on her own action, as long as her opponent sticks to his. In a periodic strategy, a concept developed in a previous paper (arXiv:1307.2035v4), in contrast, the own payoff…
In this paper we consider an extension to the classical definition of congestion games (CG) in which multiple users share the same set of resources and their payoff for using any resource is a function of the total number of users sharing…
We study the complexity of several combinatorial problems in the model of binary networked public goods games. In this game, players are represented by vertices in a network, and the action of each player can be either investing or not…
In classical job-scheduling games, each job behaves as a selfish player, choosing a machine to minimize its own completion time. To reduce the equilibria inefficiency, coordination mechanisms are employed, allowing each machine to follow…
We study competition between wireless devices with incomplete information about their opponents. We model such interactions as Bayesian interference games. Each wireless device selects a power profile over the entire available bandwidth to…
We study bottleneck routing games where the social cost is determined by the worst congestion on any edge in the network. Bottleneck games have been studied in the literature by having the player's utility costs to be determined by the…
This paper aims to reduce the communication and computation costs of the Nash equilibrium seeking strategy for the $N$-coalition noncooperative games proposed in [1]. The objective is achieved in two manners: 1. An interference graph is…
In this paper, we investigate Nash-regret minimization in congestion games, a class of games with benign theoretical structure and broad real-world applications. We first propose a centralized algorithm based on the optimism in the face of…
This paper presents a model of multi-group Bayesian games (MBGs) to describe the group behavior in Bayesian games, and gives methods to find (strongly) multi-group Bayesian Nash equilibria (MBNE) of this model with a proposed…
In this work, we consider the problem of minimising the social cost in atomic congestion games. For this problem, we provide tight computational lower bounds along with taxation mechanisms yielding polynomial time algorithms with optimal…
We study a network congestion game of discrete-time dynamic traffic of atomic agents with a single origin-destination pair. Any agent freely makes a dynamic decision at each vertex (e.g., road crossing) and traffic is regulated with given…
We address the question of whether price of stability results (existence of equilibria with low social cost) are robust to incomplete information. We show that this is the case in potential games, if the underlying algorithmic social cost…
Game-theoretic approaches and Nash equilibrium have been widely applied across various engineering domains. However, practical challenges such as disturbances, delays, and actuator limitations can hinder the precise execution of Nash…
One of the main results shown through Roughgarden's notions of smooth games and robust price of anarchy is that, for any sum-bounded utilitarian social function, the worst-case price of anarchy of coarse correlated equilibria coincides with…
In this work we study the power and limitations of fair interventions in weighted congestion games. Specifically, we focus on interventions that aim at improving the equilibrium quality (price of anarchy) and are fair in a suitably defined…
We introduce a class of Bayesian bidding games for which we prove that the set of pure Nash equilibria is a (non-empty) sublattice and we give a sufficient condition for uniqueness that is often verified in the context of markets with…
We give exponential lower bounds on the Price of Stability (PoS) of weighted congestion games with polynomial cost functions. In particular, for any positive integer $d$ we construct rather simple games with cost functions of degree at most…
In this paper, we consider stochastic monotone Nash games where each player's strategy set is characterized by possibly a large number of explicit convex constraint inequalities. Notably, the functional constraints of each player may depend…
In multiplayer games, self-interested behavior among the players can harm the social welfare. Tax mechanisms are a common method to alleviate this issue and induce socially optimal behavior. In this work, we take the initial step of…