Query complexity of approximate equilibria in anonymous games-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Query complexity of approximate equilibria in anonymous games

Published:2017-12 Issue: Volume:90 Page:80-98
ISSN:0022-0000
Container-title:Journal of Computer and System Sciences
language:en
Short-container-title:Journal of Computer and System Sciences

Author:

Goldberg Paul W.^ORCID,Turchetta Stefano^ORCID

Funder

EPSRC

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference35 articles.

1. On the deterministic complexity of searching local maxima;Althöfer;Discrete Appl. Math.,1993

2. Lipschitz games;Azrieli;Math. Oper. Res.,2013

3. Best-reply dynamics in large binary-choice anonymous games;Babichenko;Games Econ. Behav.,2013

4. Query complexity of approximate Nash equilibria;Babichenko,2014

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. PPAD-complete approximate pure Nash equilibria in Lipschitz games;Theoretical Computer Science;2023-11

2. Lower bounds for the query complexity of equilibria in Lipschitz games;Theoretical Computer Science;2023-06

3. PPAD-Complete Pure Approximate Nash Equilibria in Lipschitz Games;Algorithmic Game Theory;2022

4. The Lipschitz constant of perturbed anonymous games;International Journal of Game Theory;2021-08-13

5. Learning Convex Partitions and Computing Game-theoretic Equilibria from Best-response Queries;ACM Transactions on Economics and Computation;2021-03-31

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP