Matches in SemOpenAlex for { <https://semopenalex.org/work/W2225272567> ?p ?o ?g. }
Showing items 1 to 55 of
55
with 100 items per page.
- W2225272567 endingPage "323" @default.
- W2225272567 startingPage "309" @default.
- W2225272567 abstract "We study the complexity of motivating time-inconsistent agents to complete long term projects in a graph-based planning model as proposed by Kleinberg and Oreni¾?[5]. Given a task graph G with n nodes, our objective is to guide an agent towards a target node t under certain budget constraints. The crux is that the agent may change its strategy over time due to its present-bias. We consider two strategies to guide the agent. First, a single reward is placed at t and arbitrary edges can be removed from G. Secondly, rewards can be placed at arbitrary nodes of G but no edges must be deleted. In both cases we show that it is NP-complete to decide if a given budget is sufficient to guide the agent. For the first setting, we give complementing upper and lower bounds on the approximability of the minimum required budget. In particular, we devise a $$1+sqrt{n}$$1+n-approximation algorithm and prove NP-hardness for ratios greater than $$sqrt{n}/3$$n/3. Finally, we argue that the second setting does not permit any efficient approximation unless $$mathrm{P}=mathrm{NP}$$P=NP." @default.
- W2225272567 created "2016-06-24" @default.
- W2225272567 creator A5048481567 @default.
- W2225272567 creator A5074909595 @default.
- W2225272567 date "2016-01-01" @default.
- W2225272567 modified "2023-09-23" @default.
- W2225272567 title "Motivating Time-Inconsistent Agents: A Computational Approach" @default.
- W2225272567 cites W1512474204 @default.
- W2225272567 cites W1583523562 @default.
- W2225272567 cites W1971014051 @default.
- W2225272567 cites W2060632898 @default.
- W2225272567 cites W2100056252 @default.
- W2225272567 cites W2118052532 @default.
- W2225272567 cites W2411051863 @default.
- W2225272567 cites W2962700499 @default.
- W2225272567 cites W4239240859 @default.
- W2225272567 doi "https://doi.org/10.1007/978-3-662-54110-4_22" @default.
- W2225272567 hasPublicationYear "2016" @default.
- W2225272567 type Work @default.
- W2225272567 sameAs 2225272567 @default.
- W2225272567 citedByCount "8" @default.
- W2225272567 countsByYear W22252725672017 @default.
- W2225272567 countsByYear W22252725672018 @default.
- W2225272567 countsByYear W22252725672019 @default.
- W2225272567 countsByYear W22252725672021 @default.
- W2225272567 countsByYear W22252725672022 @default.
- W2225272567 crossrefType "book-chapter" @default.
- W2225272567 hasAuthorship W2225272567A5048481567 @default.
- W2225272567 hasAuthorship W2225272567A5074909595 @default.
- W2225272567 hasBestOaLocation W22252725672 @default.
- W2225272567 hasConcept C154945302 @default.
- W2225272567 hasConcept C41008148 @default.
- W2225272567 hasConceptScore W2225272567C154945302 @default.
- W2225272567 hasConceptScore W2225272567C41008148 @default.
- W2225272567 hasLocation W22252725671 @default.
- W2225272567 hasLocation W22252725672 @default.
- W2225272567 hasLocation W22252725673 @default.
- W2225272567 hasOpenAccess W2225272567 @default.
- W2225272567 hasPrimaryLocation W22252725671 @default.
- W2225272567 hasRelatedWork W2096946506 @default.
- W2225272567 hasRelatedWork W2350741829 @default.
- W2225272567 hasRelatedWork W2358668433 @default.
- W2225272567 hasRelatedWork W2376932109 @default.
- W2225272567 hasRelatedWork W2382290278 @default.
- W2225272567 hasRelatedWork W2390279801 @default.
- W2225272567 hasRelatedWork W2748952813 @default.
- W2225272567 hasRelatedWork W2899084033 @default.
- W2225272567 hasRelatedWork W3004735627 @default.
- W2225272567 hasRelatedWork W3107474891 @default.
- W2225272567 isParatext "false" @default.
- W2225272567 isRetracted "false" @default.
- W2225272567 magId "2225272567" @default.
- W2225272567 workType "book-chapter" @default.