Matches in SemOpenAlex for { <https://semopenalex.org/work/W3003646794> ?p ?o ?g. }
Showing items 1 to 70 of
70
with 100 items per page.
- W3003646794 startingPage "73" @default.
- W3003646794 abstract "Worst-case hardness results for most equilibrium computation problems have raised the need for beyond-worst-case analysis. To this end, we study the smoothed complexity of finding pure Nash equilibria in Network Coordination Games, a PLS-complete problem in the worst case. This is a potential game where the sequential-better-response algorithm is known to converge to a pure NE, albeit in exponential time. First, we prove polynomial (resp. quasi-polynomial) smoothed complexity when the underlying game graph is a complete (resp. arbitrary) graph, and every player has constantly many strategies. We note that the complete graph case is reminiscent of perturbing all parameters, a common assumption in most known smoothed analysis results. Second, we define a notion of smoothness-preserving reduction among search problems, and obtain reductions from $2$-strategy network coordination games to local-max-cut, and from $k$-strategy games (with arbitrary $k$) to local-max-cut up to two flips. The former together with the recent result of [BCC18] gives an alternate $O(n^8)$-time smoothed algorithm for the $2$-strategy case. This notion of reduction allows for the extension of smoothed efficient algorithms from one problem to another. For the first set of results, we develop techniques to bound the probability that an (adversarial) better-response sequence makes slow improvements on the potential. Our approach combines and generalizes the local-max-cut approaches of [ER14,ABPW17] to handle the multi-strategy case: it requires a careful definition of the matrix which captures the increase in potential, a tighter union bound on adversarial sequences, and balancing it with good enough rank bounds. We believe that the approach and notions developed herein could be of interest in addressing the smoothed complexity of other potential and/or congestion games." @default.
- W3003646794 created "2020-02-07" @default.
- W3003646794 creator A5005043203 @default.
- W3003646794 creator A5053497930 @default.
- W3003646794 creator A5070267732 @default.
- W3003646794 date "2020-01-01" @default.
- W3003646794 modified "2023-09-24" @default.
- W3003646794 title "Smoothed Efficient Algorithms and Reductions for Network Coordination Games." @default.
- W3003646794 doi "https://doi.org/10.4230/lipics.itcs.2020.73" @default.
- W3003646794 hasPublicationYear "2020" @default.
- W3003646794 type Work @default.
- W3003646794 sameAs 3003646794 @default.
- W3003646794 citedByCount "3" @default.
- W3003646794 countsByYear W30036467942019 @default.
- W3003646794 countsByYear W30036467942020 @default.
- W3003646794 countsByYear W30036467942021 @default.
- W3003646794 crossrefType "proceedings-article" @default.
- W3003646794 hasAuthorship W3003646794A5005043203 @default.
- W3003646794 hasAuthorship W3003646794A5053497930 @default.
- W3003646794 hasAuthorship W3003646794A5070267732 @default.
- W3003646794 hasConcept C111335779 @default.
- W3003646794 hasConcept C11413529 @default.
- W3003646794 hasConcept C126255220 @default.
- W3003646794 hasConcept C132525143 @default.
- W3003646794 hasConcept C179799912 @default.
- W3003646794 hasConcept C2524010 @default.
- W3003646794 hasConcept C311688 @default.
- W3003646794 hasConcept C33923547 @default.
- W3003646794 hasConcept C41008148 @default.
- W3003646794 hasConcept C46814582 @default.
- W3003646794 hasConcept C80444323 @default.
- W3003646794 hasConceptScore W3003646794C111335779 @default.
- W3003646794 hasConceptScore W3003646794C11413529 @default.
- W3003646794 hasConceptScore W3003646794C126255220 @default.
- W3003646794 hasConceptScore W3003646794C132525143 @default.
- W3003646794 hasConceptScore W3003646794C179799912 @default.
- W3003646794 hasConceptScore W3003646794C2524010 @default.
- W3003646794 hasConceptScore W3003646794C311688 @default.
- W3003646794 hasConceptScore W3003646794C33923547 @default.
- W3003646794 hasConceptScore W3003646794C41008148 @default.
- W3003646794 hasConceptScore W3003646794C46814582 @default.
- W3003646794 hasConceptScore W3003646794C80444323 @default.
- W3003646794 hasLocation W30036467941 @default.
- W3003646794 hasOpenAccess W3003646794 @default.
- W3003646794 hasPrimaryLocation W30036467941 @default.
- W3003646794 hasRelatedWork W1492453931 @default.
- W3003646794 hasRelatedWork W1680029309 @default.
- W3003646794 hasRelatedWork W2049354208 @default.
- W3003646794 hasRelatedWork W2147541332 @default.
- W3003646794 hasRelatedWork W2588799191 @default.
- W3003646794 hasRelatedWork W2611394892 @default.
- W3003646794 hasRelatedWork W2617360946 @default.
- W3003646794 hasRelatedWork W2761921260 @default.
- W3003646794 hasRelatedWork W2767487040 @default.
- W3003646794 hasRelatedWork W2900613857 @default.
- W3003646794 hasRelatedWork W2909951968 @default.
- W3003646794 hasRelatedWork W2951395930 @default.
- W3003646794 hasRelatedWork W2951762489 @default.
- W3003646794 hasRelatedWork W2996393320 @default.
- W3003646794 hasRelatedWork W3020737281 @default.
- W3003646794 hasRelatedWork W3022035936 @default.
- W3003646794 hasRelatedWork W3027556951 @default.
- W3003646794 hasRelatedWork W3153719637 @default.
- W3003646794 hasRelatedWork W3213761785 @default.
- W3003646794 hasRelatedWork W3021845393 @default.
- W3003646794 isParatext "false" @default.
- W3003646794 isRetracted "false" @default.
- W3003646794 magId "3003646794" @default.
- W3003646794 workType "article" @default.