Evidence map›Paper›PMID 26745375›Full record

ArticlePloS one2016

An Extended N-Player Network Game and Simulation of Four Investment Strategies on a Complex Innovation Network.

Wen Zhou, Nikita Koptyug, Shutao Ye, Yifan Jia, Xiaolong Lu

Abstract read
In one paragraph

Article in PloS one, 2016. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

0numbers the graph read from it
0cells of the map it votes in
2citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

2 citing papers in PubMed.

  1. Article
  2. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Wen ZhouSchool of Computer Engineering and Science, Shanghai University, Shanghai, China.
Nikita KoptyugResearch Institute of Industrial Economics (IFN), Stockholm, Sweden.
Shutao YeSchool of Computer Engineering and Science, Shanghai University, Shanghai, China.
Yifan JiaSchool of Computer Engineering and Science, Shanghai University, Shanghai, China.
Xiaolong LuSchool of Computer Engineering and Science, Shanghai University, Shanghai, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

As computer science and complex network theory develop, non-cooperative games and their formation and application on complex networks have been important research topics. In the inter-firm innovation network, it is a typical game behavior for firms to invest in their alliance partners. Accounting for the possibility that firms can be resource constrained, this paper analyzes a coordination game using the Nash bargaining solution as allocation rules between firms in an inter-firm innovation network. We build an extended inter-firm n-player game based on nonidealized conditions, describe four investment strategies and simulate the strategies on an inter-firm innovation network in order to compare their performance. By analyzing the results of our experiments, we find that our proposed greedy strategy is the best-performing in most situations. We hope this study provides a theoretical insight into how firms make investment decisions.

Indexed as

Cooperative BehaviorGame TheoryAlgorithmsInvestments

Identifiers

PMID26745375
PMCPMC4706442

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.