default search action

combined dblp search
author search
venue search
publication search

ask others

"On the Complexity of Computing Sparse Equilibria and Lower Bounds for ..."

Ioannis Anagnostides et al. (2024)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ITCS.2024.5

access: open

type: Conference or Workshop Paper

metadata version: 2024-05-07

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/innovations/AnagnostidesKSZ24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/innovations/AnagnostidesKSZ24
Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm, Manolis Zampetakis:
On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games. ITCS 2024: 5:1-5:24

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.