Stem equilibria$ (all stems)

38 papers:

STOC-2015-Barman #approximate #nash #theorem

Approximating Nash Equilibria and Dense Bipartite Subgraphs via an Approximate Version of Caratheodory’s Theorem (SB), pp. 361–369.

STOC-2015-ChenDO #complexity #game studies #nash #on the

On the Complexity of Nash Equilibria in Anonymous Games (XC, DD, AO), pp. 381–390.

ICALP-v1-2015-GargMVY #multi #nash #symmetry

ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria (JG, RM, VVV, SY), pp. 554–566.

CSL-2015-BrihayeBMR #reachability

Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability (TB, VB, NM, JFR), pp. 504–518.

CSMR-WCRE-2014-BavotaOLMGA #nash #refactoring

In medio stat virtus: Extract class refactoring through nash equilibria (GB, RO, ADL, AM, YGG, GA), pp. 214–223.

STOC-2014-Babichenko #approximate #complexity #nash #query

Query complexity of approximate nash equilibria (YB), pp. 535–544.

STOC-2014-ImKM #algorithm #constraints #scheduling

Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints (SI, JK, KM), pp. 313–322.

KR-2014-GutierrezHW #concurrent #reasoning

Reasoning about Equilibria in Game-Like Concurrent Systems (JG, PH, MW).

LICS-CSL-2014-BruyereMR #game studies

Secure equilibria in weighted games (VB, NM, JFR), p. 26.

LICS-CSL-2014-GutierrezW #concurrent #game studies

Equilibria of concurrent games on event structures (JG, MW), p. 10.

VMCAI-2014-Chatterjee0FR #game studies

Doomsday Equilibria for Omega-Regular Games (KC, LD, EF, JFR), pp. 78–97.

CAV-2013-Brenguier #concurrent #game studies #named #nash

PRALINE: A Tool for Computing Nash Equilibria in Concurrent Games (RB), pp. 890–895.

FoSSaCS-2012-BrihayeBPG #game studies #reachability

Subgame Perfection for Equilibria in Quantitative Reachability Games (TB, VB, JDP, HG), pp. 286–300.

LATA-2012-KlimosLST #concurrent #game studies #nash

Nash Equilibria in Concurrent Priced Games (MK, KGL, FS, JT), pp. 363–376.

ICALP-v2-2011-CominettiCL

Existence and Uniqueness of Equilibria for Flows over Time (RC, JRC, OL), pp. 552–563.

ICALP-v2-2011-KolliasR #game studies

Restoring Pure Equilibria to Weighted Congestion Games (KK, TR), pp. 539–551.

ICML-2011-KamisettyXL #approximate #correlation #using

Approximating Correlated Equilibria using Relaxations on the Marginal Polytope (HK, EPX, CJL), pp. 1153–1160.

ICALP-v1-2010-HarksK #game studies #nash #on the

On the Existence of Pure Nash Equilibria in Weighted Congestion Games (TH, MK), pp. 79–89.

ICALP-v2-2009-UmmelsW #complexity #game studies #multi #nash #probability

The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games (MU, DW), pp. 297–308.

ICML-2009-Even-DarM #convergence #summary #tutorial

Tutorial summary: Convergence of natural dynamics to equilibria (EED, VSM), p. 13.

CSL-2009-UmmelsW #game studies #nash #probability #problem

Decision Problems for Nash Equilibria in Stochastic Games (MU, DW), pp. 515–529.

FoSSaCS-2008-Ummels #complexity #game studies #infinity #multi #nash

The Complexity of Nash Equilibria in Infinite Multiplayer Games (MU), pp. 20–34.

STOC-2008-SkopalikV #nash

Inapproximability of pure nash equilibria (AS, BV), pp. 355–364.

KR-2008-BoothM #social

Equilibria in Social Belief Removal (RB, TAM), pp. 145–155.

ICALP-2007-KontogiannisS #algorithm #approximate #constant #game studies #performance

Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games (SCK, PGS), pp. 595–606.

STOC-2006-FischerRV #adaptation #convergence #performance

Fast convergence to Wardrop equilibria by adaptive sampling methods (SF, HR, BV), pp. 653–662.

ICALP-v1-2006-DaskalakisFP #complexity #game studies #nash

The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games (CD, AF, CHP), pp. 513–524.

STOC-2005-Papadimitriou #correlation #game studies #multi

Computing correlated equilibria in multi-player games (CHP), pp. 49–56.

ICALP-2005-GairingLMT #equilibrium #nash

Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture (MG, TL, BM, KT), pp. 51–65.

STOC-2004-FabrikantPT #complexity #nash

The complexity of pure Nash equilibria (AF, CHP, KT), pp. 604–612.

STOC-2004-GairingLMM #nash #parallel #scheduling #strict

Computing Nash equilibria for scheduling on restricted parallel links (MG, TL, MM, BM), pp. 613–622.

ICALP-2004-GairingLMMR #game studies #latency #nash

Nash Equilibria in Discrete Routing Games with Convex Latency Functions (MG, TL, MM, BM, MR), pp. 645–657.

CSL-2004-ChatterjeeMJ #game studies #nash #on the #probability

On Nash Equilibria in Stochastic Games (KC, RM, MJ), pp. 26–40.

LICS-2004-ChatterjeeHJ #game studies

Games with Secure Equilibria (KC, TAH, MJ), pp. 160–169.

ICALP-2003-Even-DarKM #convergence #nash

Convergence Time to Nash Equilibria (EED, AK, YM), pp. 502–513.

STOC-2002-DengPS #complexity #on the

On the complexity of equilibria (XD, CHP, SS), pp. 67–71.

ICALP-2002-FotakisKKMS #complexity #game studies #nash

The Structure and Complexity of Nash Equilibria for a Selfish Routing Game (DF, SCK, EK, MM, PGS), pp. 123–134.

CSL-1999-VosV #game studies #logic programming #nash #source code

Choice Logic Programs and Nash Equilibria in Strategic Games (MDV, DV), pp. 266–276.