Logarithmic Query Complexity for Approximate Nash Computation in Large Games
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1433-0490
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Logarithmic Query Complexity for Approximate Nash Computation in Large Games ; day:17 ; month:2 ; year:2018 ; pages:1-28
Theory of computing systems ; (17.2.2018), 1-28
- Klassifikation
-
Informatik
- Urheber
- Beteiligte Personen und Organisationen
-
Marmolejo-Cossío, Francisco J.
Wu, Zhiwei Steven
SpringerLink (Online service)
- DOI
-
10.1007/s00224-018-9851-8
- URN
-
urn:nbn:de:1111-2018040829111
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:49 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Goldberg, Paul
- Marmolejo-Cossío, Francisco J.
- Wu, Zhiwei Steven
- SpringerLink (Online service)
Ähnliche Objekte (12)
Approximate Query Processing: What is New and Where to Go? : A Survey on Approximate Query Processing
Optimizing Sample Design for Approximate Query Processing
A Sample Advisor for Approximate Query Processing
Computation of Approximate Border Bases and Applications
Learning Graphon Mean Field Games and Approximate Nash Equilibria
Rank-aware, Approximate Query Processing on the Semantic Web
Modeling Large Time Series for Efficient Approximate Query Processing
Approximate Query Answering and Result Refinement on XML Data
Automating approximate Bayesian computation by local linear regression
Weighted approximate Bayesian computation via Sanov’s theorem
DBEst: Revisiting Approximate Query Processing Engines with Machine Learning Models
Approximate degree and quantum query lower bounds via dual polynomials
Approximate Query Processing: What is New and Where to Go? : A Survey on Approximate Query Processing
Optimizing Sample Design for Approximate Query Processing
A Sample Advisor for Approximate Query Processing
Computation of Approximate Border Bases and Applications
Learning Graphon Mean Field Games and Approximate Nash Equilibria
Rank-aware, Approximate Query Processing on the Semantic Web
Modeling Large Time Series for Efficient Approximate Query Processing
Approximate Query Answering and Result Refinement on XML Data
Automating approximate Bayesian computation by local linear regression
Weighted approximate Bayesian computation via Sanov’s theorem
DBEst: Revisiting Approximate Query Processing Engines with Machine Learning Models
Approximate degree and quantum query lower bounds via dual polynomials
Approximate Query Processing: What is New and Where to Go? : A Survey on Approximate Query Processing
Optimizing Sample Design for Approximate Query Processing
A Sample Advisor for Approximate Query Processing
Computation of Approximate Border Bases and Applications
Learning Graphon Mean Field Games and Approximate Nash Equilibria
Rank-aware, Approximate Query Processing on the Semantic Web
Modeling Large Time Series for Efficient Approximate Query Processing
Approximate Query Answering and Result Refinement on XML Data
Automating approximate Bayesian computation by local linear regression
Weighted approximate Bayesian computation via Sanov’s theorem
DBEst: Revisiting Approximate Query Processing Engines with Machine Learning Models