Search Sciweavers | Sciweavers

Abstract: This paper defines the extensive form correlated equilibrium (EFCE) for extensive games with perfect recall. The EFCE concept extends Aumann's strategic-form correla...

Bernhard von Stengel, Françoise Forges

claim paper

Read More »

224

click to vote

NETWORKS
2008

316views Computer Networks» more NETWORKS 2008»

The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases

15 years 3 months ago

Download pluto.mscc.huji.ac.il

Asaf Levin, Daniël Paulusma, Gerhard J. Woegi...

claim paper

Read More »

220

click to vote

NETWORKS
2008

261views Computer Networks» more NETWORKS 2008»

The computational complexity of graph contractions II: Two tough polynomially solvable cases

15 years 3 months ago

Download www.win.tue.nl

Asaf Levin, Daniël Paulusma, Gerhard J. Woegi...

claim paper

Read More »

click to vote

MST
2006

53views more MST 2006»

Why Computational Complexity Requires Stricter Martingales

15 years 3 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers