default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJun Tanimoto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Md. Rajib Arefin
, Jun Tanimoto:
Coupling injunctive social norms with evolutionary games. Appl. Math. Comput. 466: 128463 (2024)- [j28]Jiaquan Huang, Yuying Zhu, Chengyi Xia, Jun Tanimoto:
The effect of nonlinear environmental feedback on the outcomes of evolutionary dynamics. Appl. Math. Comput. 483: 128990 (2024) - [j27]Shulan Li, Zhixue He, Danyang Jia, Chen Shen, Lei Shi, Jun Tanimoto:
Granting leaders priority exit options promotes and jeopardizes cooperation in social dilemmas. Neurocomputing 583: 127566 (2024) - [i2]Zehua Si, Zhixue He, Chen Shen, Jun Tanimoto:
Cooperative bots exhibit nuanced effects on cooperation across strategic frameworks. CoRR abs/2406.14913 (2024) - [i1]Zhixue He, Chen Shen, Lei Shi, Jun Tanimoto:
Unbiased third-party bots lead to a tradeoff between cooperation and social payoffs. CoRR abs/2409.14975 (2024) - 2023
- [c7]Tetsushi Ono, Aya Hagishima, Jun Tanimoto:
Evaluating Demand Response Potential of Air Conditioners in Residential Sector: A Data-Driven Approach Estimating Room Temperature. ISGT Asia 2023: 1-5 - 2022
- [j26]Yuichi Tatsukawa, Md. Rajib Arefin, Shinobu Utsumi, Kazuki Kuga, Jun Tanimoto:
Stochasticity of disease spreading derived from the microscopic simulation approach for various physical contact networks. Appl. Math. Comput. 431: 127328 (2022) - [j25]Md. Mamun-Ur-Rashid Khan, Md. Rajib Arefin, Jun Tanimoto:
Investigating the trade-off between self-quarantine and forced quarantine provisions to control an epidemic: An evolutionary approach. Appl. Math. Comput. 432: 127365 (2022) - 2021
- [j24]Kohei Miyaji, Jun Tanimoto:
The existence of fence-sitters relaxes the spatial prisoner's dilemma and enhances network reciprocity. Appl. Math. Comput. 390: 125624 (2021) - [j23]K. M. Ariful Kabir, Jun Tanimoto:
The role of pairwise nonlinear evolutionary dynamics in the rock-paper-scissors game with noise. Appl. Math. Comput. 394: 125767 (2021) - [j22]Masaki Tanaka, Jun Tanimoto:
Proposal of an apposite strategy-updating rule for the vaccination game where hubs refer to hubs and lower-degree agents refer to lower-degree agents. Biosyst. 209: 104532 (2021) - [j21]K. Nagata, Naoki Ikegaya, Jun Tanimoto:
Consideration of artificial compressibility for explicit computational fluid dynamics simulation. J. Comput. Phys. 443: 110524 (2021) - 2020
- [j20]Yoshiro Iwamura, Keisuke Nagashima, Jun Tanimoto:
Evolutionary dynamics of a 3-strategy game: Cooperator, defector and costly cooperative loner strategic types. Appl. Math. Comput. 370 (2020)
2010 – 2019
- 2019
- [j19]Muntasir Alam, Kazuki Kuga, Jun Tanimoto:
Three-strategy and four-strategy model of vaccination game introducing an intermediate protecting measure. Appl. Math. Comput. 346: 408-422 (2019) - [j18]Keisuke Nagashima, Jun Tanimoto:
A stochastic Pairwise Fermi rule modified by utilizing the average in payoff differences of neighbors leads to increased network reciprocity in spatial prisoner's dilemma games. Appl. Math. Comput. 361: 661-669 (2019) - [j17]K. M. Ariful Kabir, Jun Tanimoto:
Analysis of epidemic outbreaks in two-layer networks with different structures for information spreading and disease diffusion. Commun. Nonlinear Sci. Numer. Simul. 72: 565-574 (2019) - [j16]K. M. Ariful Kabir, Jun Tanimoto:
Vaccination strategies in a two-layer SIR/V-UA epidemic model with costly information and buzz effect. Commun. Nonlinear Sci. Numer. Simul. 76: 92-108 (2019) - 2017
- [j15]Jun Tanimoto:
How does resolution of strategy affect network reciprocity in spatial prisoner's dilemma games? Appl. Math. Comput. 301: 36-42 (2017) - [j14]Jun Tanimoto:
Coevolution of discrete, mixed, and continuous strategy systems boosts in the spatial prisoner's dilemma and chicken games. Appl. Math. Comput. 304: 20-27 (2017) - 2015
- [j13]Satoshi Kokubo, Zhen Wang, Jun Tanimoto:
Spatial reciprocity for discrete, continuous and mixed strategy setups. Appl. Math. Comput. 259: 552-568 (2015) - [j12]Jun Tanimoto:
The impact of initial cooperation fraction on the evolutionary fate in a spatial prisoner's dilemma game. Appl. Math. Comput. 263: 171-188 (2015) - 2014
- [c6]Jun Tanimoto, Shinji Kukida, Aya Hagishima, Naoki Ikegaya:
Traffic flow simulation dovetailed with evolutionary game theory. SIMULTECH 2014: 517-522 - 2012
- [j11]Weicai Zhong, Satoshi Kokubo, Jun Tanimoto:
How is the equilibrium of continuous strategy game different from that of discrete strategy game? Biosyst. 107(2): 88-94 (2012) - [c5]Noriyuki Kishimoto, Satoshi Kokubo, Jun Tanimoto:
Network reciprocity on spatial prisoner's dilemma games by Continuous-binary strategy. SCIS&ISIS 2012: 663-668 - 2011
- [j10]Atsuo Yamauchi, Jun Tanimoto, Aya Hagishima:
An analysis of network reciprocity in Prisoner's Dilemma games using Full Factorial Designs of Experiment. Biosyst. 103(1): 85-92 (2011) - [j9]Motoya Wakiyama, Jun Tanimoto:
Reciprocity phase in various 2 × 2 games by agents equipped with two-memory length strategy encouraged by grouping for interaction and adaptation. Biosyst. 103(1): 93-104 (2011) - 2010
- [j8]Atsuo Yamauchi, Jun Tanimoto, Aya Hagishima:
What controls network reciprocity in the Prisoner's Dilemma game? Biosyst. 102(2-3): 82-87 (2010)
2000 – 2009
- 2009
- [j7]Jun Tanimoto:
A simple scaling of the effectiveness of supporting mutual cooperation in donor-recipient games by various reciprocity mechanisms. Biosyst. 96(1): 29-34 (2009) - [c4]Jun Tanimoto:
The effect of assortative mixing on emerging cooperation in an evolutionary network game. IEEE Congress on Evolutionary Computation 2009: 487-493 - 2008
- [j6]Jun Tanimoto:
What initially brought about communications? Biosyst. 92(1): 82-90 (2008) - [c3]Jun Tanimoto:
Co-evolution model of networks and strategy in a 2 × 2 game emerges cooperation. IEEE Congress on Evolutionary Computation 2008: 117-122 - 2007
- [j5]Jun Tanimoto, Hiroki Sagara:
Relationship between dilemma occurrence and the existence of a weakly dominant strategy in a two-player symmetric game. Biosyst. 90(1): 105-114 (2007) - [j4]Jun Tanimoto:
Differences in dynamics between discrete strategies and continuous strategies in a multi-player game with a linear payoff structure. Biosyst. 90(2): 568-572 (2007) - [j3]Jun Tanimoto, Hiroki Sagara:
A study on emergence of alternating reciprocity in a 2 × 2 game with 2-length memory strategy. Biosyst. 90(3): 728-737 (2007) - [j2]Jun Tanimoto:
A study of indirect reciprocity involving a reputation system or a simple tag system in a one-shot, multi-player game. Biosyst. 90(3): 856-869 (2007) - [c2]Hiroki Sagara, Jun Tanimoto:
A study on social diffusive impacts of a novel car-navigation-system sharing individual information in Urban traffic systems. IEEE Congress on Evolutionary Computation 2007: 836-842 - [c1]Jun Tanimoto:
Emergence of cooperation supported by communication in a one-shot 2×2 game. IEEE Congress on Evolutionary Computation 2007: 1374-1381 - 2003
- [j1]Jun Tanimoto, Haruyuki Fujii:
A Study on Research Performance in Japanese Universities: which is More Efficient - a Professor Who is Leading his Research Group or One Who is Working Alone? The Multi-Agent Simulation knows. Adv. Complex Syst. 6(3): 375-392 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 20:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
