Equilibrium design for concurrent games
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 2243367 (Why is no real title available?)
- A course in game theory.
- Energy and mean-payoff games with imperfect information
- Energy parity games
- From model checking to equilibrium checking: reactive modules for rational verification
- Game theory. Translated from the Hebrew by Ziv Hellman and edited by Mike Borns
- Generalized mean-payoff and energy games
- Incentive engineering for Boolean games
- Iterated Boolean games
- Nash equilibrium and bisimulation invariance
- On the complexity of unique solutions
- Pure Nash equilibria in concurrent deterministic games
- Rational synthesis
- Repairing multi-player games
- Synthesis from LTL specifications with mean-payoff objectives
- Synthesis of Reactive(1) designs
- Synthesis with rational environments
- Temporal specifications with accumulative values
- The Complexity of Nash Equilibria in Limit-Average Games
- The complexity of facets (and some facets of complexity)
- The complexity of mean payoff games on graphs
- The complexity of multi-mean-payoff and multi-energy games
- The complexity of optimization problems
- The computational complexity of structure-based causality
Cited in
(6)- Formal verification and synthesis of mechanisms for social choice
- Designing equilibria in concurrent games with social welfare and temporal logic constraints
- Automatic verification of concurrent stochastic systems
- Incentive Engineering for Concurrent Games
- Characterising and verifying the core in concurrent multi-player mean-payoff games
- Multi-player equilibria verification for concurrent stochastic games
This page was built for publication: Equilibrium design for concurrent games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875383)