Existence and verification of Nash equilibria in non-cooperative contribution games with resource contention

DOI10.1007/S10472-023-09905-7MaRDI QIDQ6496422

Nicolas Troquard

Publication date: 3 May 2024

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Mathematics Subject Classification ID

Noncooperative games (91A10) Algorithmic game theory and complexity (91A68)

Cites Work

• Unnamed Item
• Unnamed Item
• Incentive engineering for Boolean games
• Linear logic
• Equilibria for games with combined qualitative and quantitative objectives
• Potential games
• Congestion games with player-specific payoff functions
• Solving coalitional resource games
• Iterated Boolean games
• A class of games possessing pure-strategy Nash equilibria
• Non-cooperative games
• Pure Nash Equilibria in Concurrent Deterministic Games
• Rational Synthesis
• The complexity of pure Nash equilibria
• Individual resource games and resource redistributions
• Fair Allocation of Indivisible Goods
• The Complexity of Computing a Nash Equilibrium
• Handbook of Computational Social Choice
• Computer Science Logic
• Negotiable Votes
• Equilibrium points in n -person games

This page was built for publication: Existence and verification of Nash equilibria in non-cooperative contribution games with resource contention