Learning game-theoretic equilibria via query protocols
Query complexity is a very widespread and recurring theme in the analysis of algorithms and computational complexity. Algorithms are assumed to have access to their input data via certain stylised queries, which impose a constraint on the way an algorithm can behave. In the context of computing equi...
| Main Author: | |
|---|---|
| Format: | Conference item |
| Language: | English |
| Published: |
Springer
2017
|