Tag #nash
36 papers:
ICML-2019-CardosoAWX #game studies- Competing Against Nash Equilibria in Adversarially Changing Zero-Sum Games (ARC, JDA, HW, HX), pp. 921–930.
- ICML-2019-HsiehLC #generative #network
- Finding Mixed Nash Equilibria of Generative Adversarial Networks (YPH, CL, VC), pp. 2810–2819.
- ICML-2017-ZhouLZ #equilibrium #game studies #identification #random
- Identify the Nash Equilibrium in Static Games with Random Payoffs (YZ, JL, JZ0), pp. 4160–4169.
ICALP-v1-2015-GargMVY #multi #symmetry- ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria (JG, RM, VVV, SY), pp. 554–566.
STOC-2015-Barman #approximate #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 #on the
- On the Complexity of Nash Equilibria in Anonymous Games (XC, DD, AO), pp. 381–390.
- STOC-2015-ColeG #approximate #social
- Approximating the Nash Social Welfare with Indivisible Items (RC, VG), pp. 371–380.
- STOC-2015-Rubinstein #equilibrium
- Inapproximability of Nash Equilibrium (AR), pp. 409–418.
CSMR-WCRE-2014-BavotaOLMGA #refactoring- In medio stat virtus: Extract class refactoring through nash equilibria (GB, RO, ADL, AM, YGG, GA), pp. 214–223.
CIG-2014-St-PierreT - The Nash and the bandit approaches for adversarial portfolios (DLSP, OT), pp. 1–7.
- STOC-2014-Babichenko #approximate #complexity #query
- Query complexity of approximate nash equilibria (YB), pp. 535–544.
- CIG-2013-NorrisW #approximate #equilibrium #statistics
- A statistical exploitation module for Texas Hold'em: And it's benefits when used with an approximate nash equilibrium strategy (KN, IDW), pp. 1–8.
CAV-2013-Brenguier #concurrent #game studies #named- PRALINE: A Tool for Computing Nash Equilibria in Concurrent Games (RB), pp. 890–895.
LATA-2012-KlimosLST #concurrent #game studies- Nash Equilibria in Concurrent Priced Games (MK, KGL, FS, JT), pp. 363–376.
- ICALP-v1-2010-HarksK #game studies #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 #probability
- The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games (MU, DW), pp. 297–308.
- STOC-2009-DaskalakisP #equilibrium #on the
- On oblivious PTAS’s for nash equilibrium (CD, CHP), pp. 75–84.
CSL-2009-UmmelsW #game studies #probability #problem- Decision Problems for Nash Equilibria in Stochastic Games (MU, DW), pp. 515–529.
KR-2008-Halpern #concept #equilibrium- Beyond Nash Equilibrium: Solution Concepts for the 21st Century (JYH), pp. 6–15.
CASE-2008-KannanGSN #approach #optimisation- A Nash bargaining approach to retention enhancing bid optimization in sponsored search auctions with discrete bids (RK, DG, KS, YN), pp. 1007–1012.
- CASE-2008-StirlingN #coordination
- Rational coordination under risk: Coherence and the Nash bargain (WCS, MSN), pp. 122–127.
FoSSaCS-2008-Ummels #complexity #game studies #infinity #multi- The Complexity of Nash Equilibria in Infinite Multiplayer Games (MU), pp. 20–34.
- STOC-2008-SkopalikV
- Inapproximability of pure nash equilibria (AS, BV), pp. 355–364.
- STOC-2007-HartM #communication #complexity #equilibrium
- The communication complexity of uncoupled nash equilibrium procedures (SH, YM), pp. 345–353.
- ICALP-v1-2006-DaskalakisFP #complexity #game studies
- The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games (CD, AF, CHP), pp. 513–524.
- STOC-2006-DaskalakisGP #complexity #equilibrium
- The complexity of computing a Nash equilibrium (CD, PWG, CHP), pp. 71–78.
- CSL-2006-Chatterjee06a #equilibrium
- Nash Equilibrium for Upward-Closed Objectives (KC), pp. 271–286.
- ICALP-2005-GairingLMT #equilibrium
- Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture (MG, TL, BM, KT), pp. 51–65.
- ICALP-2004-GairingLMMR #game studies #latency
- Nash Equilibria in Discrete Routing Games with Convex Latency Functions (MG, TL, MM, BM, MR), pp. 645–657.
- STOC-2004-FabrikantPT #complexity
- The complexity of pure Nash equilibria (AF, CHP, KT), pp. 604–612.
- STOC-2004-GairingLMM #parallel #scheduling #strict
- Computing Nash equilibria for scheduling on restricted parallel links (MG, TL, MM, BM), pp. 613–622.
- CSL-2004-ChatterjeeMJ #game studies #on the #probability
- On Nash Equilibria in Stochastic Games (KC, RM, MJ), pp. 26–40.
- ICALP-2003-Even-DarKM #convergence
- Convergence Time to Nash Equilibria (EED, AK, YM), pp. 502–513.
- ICALP-2002-FotakisKKMS #complexity #game studies
- The Structure and Complexity of Nash Equilibria for a Selfish Routing Game (DF, SCK, EK, MM, PGS), pp. 123–134.
- ICML-2001-JafariGGE #equilibrium #game studies #learning #on the
- On No-Regret Learning, Fictitious Play, and Nash Equilibrium (AJ, AG, DG, GE), pp. 226–233.
- CSL-1999-VosV #game studies #logic programming #source code
- Choice Logic Programs and Nash Equilibria in Strategic Games (MDV, DV), pp. 266–276.
