[PDF][PDF] Algorithmic game theory
T Roughgarden - Communications of the ACM, 2010 - dl.acm.org
Algorithmic game theory Page 1 78 communications of the acm | july 2010 | vol. 53 | no. 7 review
articles The widespread adopTioN of the Internet and the emergence of the Web changed …
articles The widespread adopTioN of the Internet and the emergence of the Web changed …
[BOOK][B] Multiagent systems: Algorithmic, game-theoretic, and logical foundations
Y Shoham, K Leyton-Brown - 2008 - books.google.com
Multiagent systems combine multiple autonomous entities, each having diverging interests
or different information. This overview of the field offers a computer science perspective, but …
or different information. This overview of the field offers a computer science perspective, but …
Computing equilibria for two-person games
B Von Stengel - Handbook of game theory with economic applications, 2002 - Elsevier
This paper is a self-contained survey of algorithms for computing Nash equilibria of two-
person games. The games may be given in strategic form or extensive form. The classical …
person games. The games may be given in strategic form or extensive form. The classical …
The complexity of computing a Nash equilibrium
How long does it take until economic agents converge to an equilibrium? By studying the
complexity of the problem of computing a mixed Nash equilibrium in a game, we provide …
complexity of the problem of computing a mixed Nash equilibrium in a game, we provide …
[BOOK][B] Moments, positive polynomials and their applications
JB Lasserre - 2009 - books.google.com
Many important applications in global optimization, algebra, probability and statistics,
applied mathematics, control theory, financial mathematics, inverse problems, etc. can be …
applied mathematics, control theory, financial mathematics, inverse problems, etc. can be …
Probabilistic model checking and autonomy
The design and control of autonomous systems that operate in uncertain or adversarial
environments can be facilitated by formal modeling and analysis. Probabilistic model …
environments can be facilitated by formal modeling and analysis. Probabilistic model …
On the complexity of the parity argument and other inefficient proofs of existence
CH Papadimitriou - Journal of Computer and system Sciences, 1994 - Elsevier
We define several new complexity classes of search problems,“between” the classes FP and
FNP. These new classes are contained, along with factoring, and the class PLS, in the class …
FNP. These new classes are contained, along with factoring, and the class PLS, in the class …
[PDF][PDF] Agent-based modeling in economics and finance: Past, present, and future
Agent-based modeling (ABM) is a novel computational methodology for representing the
behavior of individuals in order to study social phenomena. Its use is rapidly growing in …
behavior of individuals in order to study social phenomena. Its use is rapidly growing in …
The complexity of constrained min-max optimization
Despite its important applications in Machine Learning, min-max optimization of objective
functions that are nonconvex-nonconcave remains elusive. Not only are there no known first …
functions that are nonconvex-nonconcave remains elusive. Not only are there no known first …
The complexity of markov equilibrium in stochastic games
We show that computing approximate stationary Markov coarse correlated equilibria (CCE)
in general-sum stochastic games is PPAD-hard, even when there are two players, the game …
in general-sum stochastic games is PPAD-hard, even when there are two players, the game …