Scholars@Duke

Computing Stackelberg strategies in stochastic games

Publication ,  Journal Article
Letchford, J; MacDermed, L; Conitzer, V; Parr, R; Isbell, CL
Published in: ACM SIGecom Exchanges
December 2012
Published version (DOI) Publisher Link

Significant recent progress has been made in both the computation of optimal strategies to commit to (Stackelberg strategies), and the computation of correlated equilibria of stochastic games. In this letter we discuss some recent results in the intersection of these two areas. We investigate how valuable commitment can be in stochastic games and give a brief summary of complexity results about computing Stackelberg strategies in stochastic games.

Duke Scholars

Vincent Conitzer
Author Vincent Conitzer Computer Science

Published In

ACM SIGecom Exchanges

DOI

10.1145/2509002.2509011

EISSN

1551-9031

Publication Date

December 2012

Volume

11

Issue

2

Start / End Page

36 / 40

Publisher

Association for Computing Machinery (ACM)
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Letchford, J., MacDermed, L., Conitzer, V., Parr, R., & Isbell, C. L. (2012). Computing Stackelberg strategies in stochastic games. ACM SIGecom Exchanges, 11(2), 36–40. https://doi.org/10.1145/2509002.2509011
Letchford, Joshua, Liam MacDermed, Vincent Conitzer, Ronald Parr, and Charles L. Isbell. “Computing Stackelberg strategies in stochastic games.” ACM SIGecom Exchanges 11, no. 2 (December 2012): 36–40. https://doi.org/10.1145/2509002.2509011.
Letchford J, MacDermed L, Conitzer V, Parr R, Isbell CL. Computing Stackelberg strategies in stochastic games. ACM SIGecom Exchanges. 2012 Dec;11(2):36–40.
Letchford, Joshua, et al. “Computing Stackelberg strategies in stochastic games.” ACM SIGecom Exchanges, vol. 11, no. 2, Association for Computing Machinery (ACM), Dec. 2012, pp. 36–40. Crossref, doi:10.1145/2509002.2509011.
Letchford J, MacDermed L, Conitzer V, Parr R, Isbell CL. Computing Stackelberg strategies in stochastic games. ACM SIGecom Exchanges. Association for Computing Machinery (ACM); 2012 Dec;11(2):36–40.

Published In

ACM SIGecom Exchanges

DOI

10.1145/2509002.2509011

EISSN

1551-9031

Publication Date

December 2012

Volume

11

Issue

2

Start / End Page

36 / 40

Publisher

Association for Computing Machinery (ACM)