发现好书期刊,享受阅读乐趣

海量图书期刊资源,随时随地畅享阅读乐趣

Logarithmic Query Complexity for Approximate Nash Computation in Large Games

Logarithmic Query Complexity for Approximate Nash Computation in Large Games

Goldberg, Paul W.; Marmolejo-Cossío, Francisco J.; Wu, Zhiwei Steven
  • 期刊名称Theory of Computing Systems
  • 作者Goldberg, Paul W.; Marmolejo-Cossío, Francisco J.; Wu, Zhiwei Steven
  • 印刷ISSN1432-4350
  • 电子ISSN1433-0490
  • 文件大小1318.67KB
  • 发表时间2018-2-17
  • DOI10.1007/s00224-018-9851-8
← 返回【学霸图书馆】主页