Equilibria of Games in Networks for Local Tasks
From MaRDI portal
Publication:5091077
DOI10.4230/LIPIcs.OPODIS.2018.6OpenAlexW2912191623MaRDI QIDQ5091077
Simon Collet, Paolo Penna, Pierre Fraigniaud
Publication date: 21 July 2022
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/10066/pdf/LIPIcs-OPODIS-2018-6.pdf/
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Cites Work
- Unnamed Item
- Strategic information transmission networks
- Subgame-perfect equilibria of finite- and infinite-horizon games
- Collusive behavior in noncooperative epsilon-equilibria of oligopolies with long but finite lives
- Reexamination of the perfectness concept for equilibrium points in extensive games
- Equilibrium in behavior strategies in infinite extensive form games with imperfect information
- Bayesian Learning in Social Networks
- Distributed Protocols for Leader Election: A Game-Theoretic Perspective
- Distributed computing building blocks for rational agents
- Strategic Communication Networks
- Existence and Characterization of Perfect Equilibrium in Games of Perfect Information
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- Locality in Distributed Graph Algorithms
- Distributed Computing: A Locality-Sensitive Approach
- Communication and influence
- What Can be Computed Locally?
- Distributed Graph Coloring: Fundamentals and Recent Developments
- Maximal independent sets in radio networks
- Algorithms – ESA 2004
- Equilibrium points in n -person games
- A Further Generalization of the Kakutani Fixed Point Theorem, with Application to Nash Equilibrium Points
- Fixed-point and Minimax Theorems in Locally Convex Topological Linear Spaces
This page was built for publication: Equilibria of Games in Networks for Local Tasks
