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
|
| _version_ | 1797070459567603712 |
|---|---|
| author | Goldberg, P |
| author_facet | Goldberg, P |
| author_sort | Goldberg, P |
| collection | OXFORD |
| description | 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 equilibria of games, this is a relatively recent line of work, which we review here. The talk mostly focuses on the paper Fearnley et al. (Learning equilibria of games via payoff queries. In: Proceedings of the 14th ACM-EC, pp 397–414, 2013). |
| first_indexed | 2024-03-06T22:39:09Z |
| format | Conference item |
| id | oxford-uuid:5aecd210-b624-4706-9ec1-750c8850513a |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-06T22:39:09Z |
| publishDate | 2017 |
| publisher | Springer |
| record_format | dspace |
| spelling | oxford-uuid:5aecd210-b624-4706-9ec1-750c8850513a2022-03-26T17:18:58ZLearning game-theoretic equilibria via query protocolsConference itemhttp://purl.org/coar/resource_type/c_5794uuid:5aecd210-b624-4706-9ec1-750c8850513aEnglishSymplectic Elements at OxfordSpringer2017Goldberg, PQuery 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 equilibria of games, this is a relatively recent line of work, which we review here. The talk mostly focuses on the paper Fearnley et al. (Learning equilibria of games via payoff queries. In: Proceedings of the 14th ACM-EC, pp 397–414, 2013). |
| spellingShingle | Goldberg, P Learning game-theoretic equilibria via query protocols |
| title | Learning game-theoretic equilibria via query protocols |
| title_full | Learning game-theoretic equilibria via query protocols |
| title_fullStr | Learning game-theoretic equilibria via query protocols |
| title_full_unstemmed | Learning game-theoretic equilibria via query protocols |
| title_short | Learning game-theoretic equilibria via query protocols |
| title_sort | learning game theoretic equilibria via query protocols |
| work_keys_str_mv | AT goldbergp learninggametheoreticequilibriaviaqueryprotocols |