设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
Springer电子图书(1)
CNKI学位论文(120)
知网期刊论文(43)
在“
SpringerLink电子期刊
”中,
命中:
124
条,耗时:0.0120288 秒
在所有数据库中总计命中:
164
条
1.
Computing
Approximate
Nash
Equilibria
in Polymatrix Games
作者:
Argyrios Deligkas
;
John Fearnley
;
Rahul Savani
;
Paul Spirakis
关键词:
Approximate
Nash
equilibria
;
Gradient descent
;
Polymatrix games
;
Bayesian games
刊名:Algorithmica
出版年:2017
2.
On the performance of mildly greedy players in cut games
作者:
Vittorio Bilò
;
Mauro Paladini
关键词:
Cut games
;
(
Approximate
)
Nash
equilibria
;
Price of anarchy
刊名:Journal of Combinatorial Optimization
出版年:2016
3.
Approximate
Well-supported
Nash
Equilibria
Below Two-thirds
作者:
John Fearnley
;
Paul W. Goldberg
;
Rahul Savani
;
Troels Bjerre Sørensen
刊名:Algorithmica
出版年:2016
4.
Approximate
robustness of equilibrium to incomplete information
作者:
Ori Haimanko
;
Atsushi Kajii
关键词:
Incomplete information
;
Robustness
;
Bayesian
Nash
equilibrium
;
\(\varepsilon \)
;
equilibrium
;
Upper hemicontinuity
;
Zero
;
sum games
刊名:International Journal of Game Theory
出版年:2016
5.
Inapproximability Results for
Approximate
Nash
Equilibria
刊名:Lecture Notes in Computer Science
出版年:2016
6.
Distributed Methods for Computing
Approximate
Equilibria
刊名:Lecture Notes in Computer Science
出版年:2016
7.
On the Robustness of the
Approximate
Price of Anarchy in Generalized Congestion Games
刊名:Lecture Notes in Computer Science
出版年:2016
8.
Symmetry and
approximate
equilibria
in games with countably many players
作者:
Shiran Rachmilevitch
刊名:International Journal of Game Theory
出版年:2016
9.
When Can Limited Randomness Be Used in Repeated Games?
作者:
Pavel Hubáček
;
Moni Naor
;
Jonathan Ullman
关键词:
Game theory
;
Cryptography
;
Finitely repeated games
;
Nash
equilibrium
;
Limited randomness
;
Entropy
;
Pseudorandom generators
;
One
;
way functions
刊名:Theory of Computing Systems
出版年:2016
10.
Logarithmic Query Complexity for
Approximate
Nash
Computation in Large Games
刊名:Lecture Notes in Computer Science
出版年:2016
1
2
3
4
5
6
7
8
9
按检索点细分(124)
题名(25)
关键词(6)
文摘(100)
按出版年细分(124)
2017年(1)
2016年(16)
2015年(9)
2014年(11)
2013年(10)
2012年(11)
2011年(3)
2010年(7)
2009年(11)
2008年(13)
2007年(16)
2006年(2)
2005年(7)
2003年(1)
2000年(1)
2000年及以前(5)
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via
email
.