Related papers: Weighted and Roughly Weighted Simple Games
Mean-field games (MFGs) are models for large populations of competing rational agents that seek to optimize a suitable functional. In the case of congestion, this functional takes into account the difficulty of moving in high-density areas.…
The use of monotonicity and Tarski's theorem in existence proofs of equilibria is very widespread in economics, while Tarski's theorem is also often used for similar purposes in the context of verification. However, there has been…
The Nakamura number is an appropriate invariant of a simple game to study the existence of social equilibria and the possibility of cycles. For symmetric quota games its number can be obtained by an easy formula. For some subclasses of…
We consider variational Mean Field Games endowed with a constraint on the maximal density of the distribution of players. Minimizers of the variational formulation are equilibria for a game where both the running cost and the final cost of…
We consider structural and algorithmic questions related to the Nash dynamics of weighted congestion games. In weighted congestion games with linear latency functions, the existence of (pure Nash) equilibria is guaranteed by potential…
The concept of dimension in simple games was introduced as a measure of the remoteness of a given game from a weighted game. Taylor and Zwicker (1993) demonstrated that the dimension of a simple game can grow exponentially in the number of…
In general, Nash equilibria in normal-form games may require players to play (probabilistically) mixed strategies. We define a measure of the complexity of finite probability distributions and study the complexity required to play Nash…
The aim of this paper is to bring together the notions of quantum game and game isomorphism. The work is intended as an attempt to introduce a new criterion for quantum game schemes. The generally accepted requirement forces a quantum…
A fundamental problem with the Nash equilibrium concept is the existence of certain "structurally deficient" equilibria that (i) lack fundamental robustness properties, and (ii) are difficult to analyze. The notion of a "regular" Nash…
The model of incomplete cooperative games incorporates uncertainty into the classical model of cooperative games by considering a partial characteristic function. Thus the values for some of the coalitions are not known. The main focus of…
We study the existence of approximate pure Nash equilibria ($\alpha$-PNE) in weighted atomic congestion games with polynomial cost functions of maximum degree $d$. Previously it was known that $d$-approximate equilibria always exist, while…
A game is rigid if a near-optimal score guarantees, under the sole assumption of the validity of quantum mechanics, that the players are using an approximately unique quantum strategy. Rigidity has a vital role in quantum cryptography as it…
This paper investigates some necessary and sufficient conditions for a game to be a potential game. At first, we extend the classical results of Slade and Monderer and Shapley from games with one-dimensional action spaces to games with…
The following problem is considered. Two players are each required to allocate a quota of~$n$ counters among~$k$ boxes labelled~$1,2,\ldots,k$. At times $t=1,2,3,\ldots$ a random box is identified; the probability of choosing box~$i$…
In this paper, we consider Mean Field Games in the presence of common noise relaxing the usual independence assumption of individual random noise. We assume a simple linear model with terminal cost satisfying a convexity and a weak…
Heifetz, Meier, and Schipper (2013) introduced dynamic game with unawareness consisting of a partially ordered set of games in extensive form. Here, we study the normal form of dynamic games with unawareness. The generalized normal form…
Let $f(n)$ be a strongly additive complex valued arithmetic function. Under mild conditions on $f$, we prove the following weighted strong law of large numbers: if $ X,X_1,X_2,... $ is any sequence of integrable i.i.d. random variables,…
We show that a uniform measure density condition implies game regularity for all $2<p<\infty$ in a stochastic game called 'tug-of-war with noise'. The proof utilizes suitable choices of strategies combined with estimates for the associated…
The Value Problem for weighted timed games (wtgs) consists in determining, given a two-player weighted timed game with a reachability objective and a rational threshold, whether or not the value of the game exceeds the threshold. When…
In this paper, the author puts forward a variation of Feige's Hypothesis, which claims that it is hard on average refuting Unbalanced Max 3-XOR under biased assignments on a natural distribution. Under this hypothesis, the author…