Attaining equilibria using control sets

Cites work

A crash course in implementation theory
A unified approach to approximating resource allocation and scheduling
Algorithmic Game Theory
Approximation algorithms for combinatorial problems
Attaining equilibria using control sets
Beyond dominance and Nash: ranking equilibria by critical mass
Circumventing the price of anarchy: leading dynamics to good behavior
Computing correlated equilibria in multi-player games
Congestion games with player-specific payoff functions
Contagion
Control of Learning in Anticoordination Network Games
Coordination games on graphs
Distributed computing meets game theory
Dynamic models of segregation†
Fault Tolerant Implementation
Flows and decompositions of games: harmonic and potential games
scientific article; zbMATH DE number 3889282 (Why is no real title available?)
scientific article; zbMATH DE number 3139273 (Why is no real title available?)
scientific article; zbMATH DE number 2038846 (Why is no real title available?)
scientific article; zbMATH DE number 1559563 (Why is no real title available?)
Improved equilibria via public service advertising
Non-cooperative games
On approximation problems related to the independent set and vertex cover problems
On the approximability of influence in social networks
On the minimum hitting set of bundles problem
Optimization, approximation, and complexity classes
Parameterizations of hitting set of bundles and inverse scope
Potential games
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
Reducibility among combinatorial problems
Stackelberg Scheduling Strategies
Stackelberg Strategies for Atomic Congestion Games
Stackelberg strategies for network design games
Strong mediated equilibrium
The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems

This page was built for publication: Attaining equilibria using control sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6848798)