Matches in SemOpenAlex for { <https://semopenalex.org/work/W4288100124> ?p ?o ?g. }
Showing items 1 to 51 of
51
with 100 items per page.
- W4288100124 abstract "In this paper we consider a local service-requirement assignment problem named exact capacitated domination from an algorithmic point of view. This problem aims to find a solution (a Nash equilibrium) to a game-theoretic model of public good provision. In the problem we are given a capacitated graph, a graph with a parameter defined on each vertex that is interpreted as the capacity of that vertex. The objective is to find a DP-Nash subgraph: a spanning bipartite subgraph with partite sets D and P, called the D-set and P-set respectively, such that no vertex in P is isolated and that each vertex in D is adjacent to a number of vertices equal to its capacity. We show that whether a capacitated graph has a unique DP-Nash subgraph can be decided in polynomial time. However, we also show that the nearby problem of deciding whether a capacitated graph has a unique D-set is co-NP-complete." @default.
- W4288100124 created "2022-07-28" @default.
- W4288100124 creator A5012051081 @default.
- W4288100124 creator A5015202196 @default.
- W4288100124 creator A5044021493 @default.
- W4288100124 date "2020-03-16" @default.
- W4288100124 modified "2023-10-17" @default.
- W4288100124 title "Exact capacitated domination: on the computational complexity of uniqueness" @default.
- W4288100124 doi "https://doi.org/10.48550/arxiv.2003.07106" @default.
- W4288100124 hasPublicationYear "2020" @default.
- W4288100124 type Work @default.
- W4288100124 citedByCount "0" @default.
- W4288100124 crossrefType "posted-content" @default.
- W4288100124 hasAuthorship W4288100124A5012051081 @default.
- W4288100124 hasAuthorship W4288100124A5015202196 @default.
- W4288100124 hasAuthorship W4288100124A5044021493 @default.
- W4288100124 hasBestOaLocation W42881001241 @default.
- W4288100124 hasConcept C114614502 @default.
- W4288100124 hasConcept C118615104 @default.
- W4288100124 hasConcept C126255220 @default.
- W4288100124 hasConcept C132525143 @default.
- W4288100124 hasConcept C197657726 @default.
- W4288100124 hasConcept C2778012994 @default.
- W4288100124 hasConcept C33923547 @default.
- W4288100124 hasConcept C46814582 @default.
- W4288100124 hasConcept C80899671 @default.
- W4288100124 hasConceptScore W4288100124C114614502 @default.
- W4288100124 hasConceptScore W4288100124C118615104 @default.
- W4288100124 hasConceptScore W4288100124C126255220 @default.
- W4288100124 hasConceptScore W4288100124C132525143 @default.
- W4288100124 hasConceptScore W4288100124C197657726 @default.
- W4288100124 hasConceptScore W4288100124C2778012994 @default.
- W4288100124 hasConceptScore W4288100124C33923547 @default.
- W4288100124 hasConceptScore W4288100124C46814582 @default.
- W4288100124 hasConceptScore W4288100124C80899671 @default.
- W4288100124 hasLocation W42881001241 @default.
- W4288100124 hasOpenAccess W4288100124 @default.
- W4288100124 hasPrimaryLocation W42881001241 @default.
- W4288100124 hasRelatedWork W12110406 @default.
- W4288100124 hasRelatedWork W25648989 @default.
- W4288100124 hasRelatedWork W29316508 @default.
- W4288100124 hasRelatedWork W33284111 @default.
- W4288100124 hasRelatedWork W33827085 @default.
- W4288100124 hasRelatedWork W42446184 @default.
- W4288100124 hasRelatedWork W49300120 @default.
- W4288100124 hasRelatedWork W56416453 @default.
- W4288100124 hasRelatedWork W6502245 @default.
- W4288100124 hasRelatedWork W8866102 @default.
- W4288100124 isParatext "false" @default.
- W4288100124 isRetracted "false" @default.
- W4288100124 workType "article" @default.