Matches in SemOpenAlex for { <https://semopenalex.org/work/W4387686983> ?p ?o ?g. }
Showing items 1 to 51 of
51
with 100 items per page.
- W4387686983 abstract "In the famous network creation game of Fabrikant et al. a set of agents play a game to build a connected graph. The $n$ agents form the vertex set $V$ of the graph and each vertex $vin V$ buys a set $E_v$ of edges inducing a graph $G=(V,bigcuplimits_{vin V} E_v)$. The private objective of each vertex is to minimize the sum of its building cost (the cost of the edges it buys) plus its connection cost (the total distance from itself to every other vertex). Given a cost of $alpha$ for each individual edge, a long-standing conjecture, called the tree conjecture, states that if $alpha > n$ then every Nash equilibrium graph in the game is a spanning tree. After a plethora of work, it is known that the conjecture holds for any $alpha>3n-3$. In this paper we prove the tree conjecture holds for $alpha>2n$. This reduces by half the open range for $alpha$ with only $[n, 2n)$ remaining in order to settle the conjecture." @default.
- W4387686983 created "2023-10-17" @default.
- W4387686983 creator A5027727214 @default.
- W4387686983 creator A5072250969 @default.
- W4387686983 date "2023-10-12" @default.
- W4387686983 modified "2023-10-18" @default.
- W4387686983 title "One n Remains to Settle the Tree Conjecture" @default.
- W4387686983 doi "https://doi.org/10.48550/arxiv.2310.08663" @default.
- W4387686983 hasPublicationYear "2023" @default.
- W4387686983 type Work @default.
- W4387686983 citedByCount "0" @default.
- W4387686983 crossrefType "posted-content" @default.
- W4387686983 hasAuthorship W4387686983A5027727214 @default.
- W4387686983 hasAuthorship W4387686983A5072250969 @default.
- W4387686983 hasBestOaLocation W43876869831 @default.
- W4387686983 hasConcept C113174947 @default.
- W4387686983 hasConcept C114614502 @default.
- W4387686983 hasConcept C118615104 @default.
- W4387686983 hasConcept C132525143 @default.
- W4387686983 hasConcept C144237770 @default.
- W4387686983 hasConcept C2780990831 @default.
- W4387686983 hasConcept C33923547 @default.
- W4387686983 hasConcept C46814582 @default.
- W4387686983 hasConcept C64331007 @default.
- W4387686983 hasConcept C80899671 @default.
- W4387686983 hasConceptScore W4387686983C113174947 @default.
- W4387686983 hasConceptScore W4387686983C114614502 @default.
- W4387686983 hasConceptScore W4387686983C118615104 @default.
- W4387686983 hasConceptScore W4387686983C132525143 @default.
- W4387686983 hasConceptScore W4387686983C144237770 @default.
- W4387686983 hasConceptScore W4387686983C2780990831 @default.
- W4387686983 hasConceptScore W4387686983C33923547 @default.
- W4387686983 hasConceptScore W4387686983C46814582 @default.
- W4387686983 hasConceptScore W4387686983C64331007 @default.
- W4387686983 hasConceptScore W4387686983C80899671 @default.
- W4387686983 hasLocation W43876869831 @default.
- W4387686983 hasOpenAccess W4387686983 @default.
- W4387686983 hasPrimaryLocation W43876869831 @default.
- W4387686983 hasRelatedWork W1581373162 @default.
- W4387686983 hasRelatedWork W2039864950 @default.
- W4387686983 hasRelatedWork W2099219074 @default.
- W4387686983 hasRelatedWork W2374925474 @default.
- W4387686983 hasRelatedWork W2784911598 @default.
- W4387686983 hasRelatedWork W3194471551 @default.
- W4387686983 hasRelatedWork W4287023968 @default.
- W4387686983 hasRelatedWork W4288279572 @default.
- W4387686983 hasRelatedWork W4297950433 @default.
- W4387686983 hasRelatedWork W4375956809 @default.
- W4387686983 isParatext "false" @default.
- W4387686983 isRetracted "false" @default.
- W4387686983 workType "article" @default.