Back to Results
First PageMeta Content
Decision theory / Minimax / Nash equilibrium / Outcome / Strategy / Repeated game / Zero–sum game / Normal-form game / Risk dominance / Game theory / Problem solving / Mathematics


Fast Equilibrium Computation for Infinitely Repeated Games Garrett Andersen Vincent Conitzer Department of Computer Science
Add to Reading List

Document Date: 2013-04-05 11:30:14

Open Document

File Size: 981,13 KB

Share Result on Facebook

City

Kontogiannis / /

Company

SIAM Journal / Brown / Multi-Agent Systems / Decision Support Systems / John Wiley & Sons / /

Country

United States / /

/

Facility

Computer Science Duke University / /

IndustryTerm

equilibrium algorithm / double oracle algorithm / limit-average utilities / game-theoretic algorithms / even computing minimax strategies / /

Organization

Department of Computer Science Duke University Durham / Infinitely Repeated Games Garrett Andersen Vincent Conitzer Department of Computer Science Duke University Durham / National Science Foundation / ARO / Artificial Copyright Intelligence / Association for the Advancement / /

Person

Kalai / Nash / Hansen / /

Position

specific player / deviating player / row player / player / T. D. / punished player / column player / left end / /

ProvinceOrState

South Carolina / North Carolina / /

PublishedMedium

SIAM Journal on Computing / Journal of the ACM / Games and Economic Behavior / Communications of the ACM / /

Technology

LP-based algorithm / polynomial-time Nash equilibrium algorithm / artificial intelligence / 1 If Algorithm / double oracle algorithm / game-theoretic algorithms / 1 then Algorithm / imagine running the LP-based algorithm / /

URL

www.aaai.org / /

SocialTag