BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
equilibria (21)
game (14)
complex (9)
equilibrium (8)
approxim (4)

Stem nash$ (all stems)

32 papers:

STOCSTOC-2015-Barman #approximate #nash #theorem
Approximating Nash Equilibria and Dense Bipartite Subgraphs via an Approximate Version of Caratheodory’s Theorem (SB), pp. 361–369.
STOCSTOC-2015-ChenDO #complexity #game studies #nash #on the
On the Complexity of Nash Equilibria in Anonymous Games (XC, DD, AO), pp. 381–390.
STOCSTOC-2015-ColeG #approximate #nash #social
Approximating the Nash Social Welfare with Indivisible Items (RC, VG), pp. 371–380.
STOCSTOC-2015-Rubinstein #equilibrium #nash
Inapproximability of Nash Equilibrium (AR), pp. 409–418.
ICALPICALP-v1-2015-GargMVY #multi #nash #symmetry
ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria (JG, RM, VVV, SY), pp. 554–566.
SANERCSMR-WCRE-2014-BavotaOLMGA #nash #refactoring
In medio stat virtus: Extract class refactoring through nash equilibria (GB, RO, ADL, AM, YGG, GA), pp. 214–223.
STOCSTOC-2014-Babichenko #approximate #complexity #nash #query
Query complexity of approximate nash equilibria (YB), pp. 535–544.
KRKR-2014-IanovskiO #game studies
EGuaranteeNash for Boolean Games Is NEXP-Hard (EI, LO).
CAVCAV-2013-Brenguier #concurrent #game studies #named #nash
PRALINE: A Tool for Computing Nash Equilibria in Concurrent Games (RB), pp. 890–895.
LATALATA-2012-KlimosLST #concurrent #game studies #nash
Nash Equilibria in Concurrent Priced Games (MK, KGL, FS, JT), pp. 363–376.
ICALPICALP-v1-2010-HarksK #game studies #nash #on the
On the Existence of Pure Nash Equilibria in Weighted Congestion Games (TH, MK), pp. 79–89.
STOCSTOC-2009-DaskalakisP #equilibrium #nash #on the
On oblivious PTAS’s for nash equilibrium (CD, CHP), pp. 75–84.
ICALPICALP-v2-2009-UmmelsW #complexity #game studies #multi #nash #probability
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games (MU, DW), pp. 297–308.
CSLCSL-2009-UmmelsW #game studies #nash #probability #problem
Decision Problems for Nash Equilibria in Stochastic Games (MU, DW), pp. 515–529.
CASECASE-2008-KannanGSN #approach #nash #optimisation
A Nash bargaining approach to retention enhancing bid optimization in sponsored search auctions with discrete bids (RK, DG, KS, YN), pp. 1007–1012.
CASECASE-2008-StirlingN #coordination #nash
Rational coordination under risk: Coherence and the Nash bargain (WCS, MSN), pp. 122–127.
FoSSaCSFoSSaCS-2008-Ummels #complexity #game studies #infinity #multi #nash
The Complexity of Nash Equilibria in Infinite Multiplayer Games (MU), pp. 20–34.
STOCSTOC-2008-SkopalikV #nash
Inapproximability of pure nash equilibria (AS, BV), pp. 355–364.
KRKR-2008-Halpern #concept #equilibrium #nash
Beyond Nash Equilibrium: Solution Concepts for the 21st Century (JYH), pp. 6–15.
STOCSTOC-2007-HartM #communication #complexity #equilibrium #nash
The communication complexity of uncoupled nash equilibrium procedures (SH, YM), pp. 345–353.
STOCSTOC-2006-DaskalakisGP #complexity #equilibrium #nash
The complexity of computing a Nash equilibrium (CD, PWG, CHP), pp. 71–78.
ICALPICALP-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.
CSLCSL-2006-Chatterjee06a #equilibrium #nash
Nash Equilibrium for Upward-Closed Objectives (KC), pp. 271–286.
ICALPICALP-2005-GairingLMT #equilibrium #nash
Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture (MG, TL, BM, KT), pp. 51–65.
STOCSTOC-2004-FabrikantPT #complexity #nash
The complexity of pure Nash equilibria (AF, CHP, KT), pp. 604–612.
STOCSTOC-2004-GairingLMM #nash #parallel #scheduling #strict
Computing Nash equilibria for scheduling on restricted parallel links (MG, TL, MM, BM), pp. 613–622.
ICALPICALP-2004-GairingLMMR #game studies #latency #nash
Nash Equilibria in Discrete Routing Games with Convex Latency Functions (MG, TL, MM, BM, MR), pp. 645–657.
CSLCSL-2004-ChatterjeeMJ #game studies #nash #on the #probability
On Nash Equilibria in Stochastic Games (KC, RM, MJ), pp. 26–40.
ICALPICALP-2003-Even-DarKM #convergence #nash
Convergence Time to Nash Equilibria (EED, AK, YM), pp. 502–513.
ICALPICALP-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.
ICMLICML-2001-JafariGGE #equilibrium #game studies #learning #nash #on the
On No-Regret Learning, Fictitious Play, and Nash Equilibrium (AJ, AG, DG, GE), pp. 226–233.
CSLCSL-1999-VosV #game studies #logic programming #nash #source code
Choice Logic Programs and Nash Equilibria in Strategic Games (MDV, DV), pp. 266–276.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.