default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMasahiko Ueda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j8]Masahiko Ueda:
On the implementation of zero-determinant strategies in repeated games. Appl. Math. Comput. 489: 129179 (2025)- 2023
- [j7]Masahiko Ueda
:
Unexploitable Games and Unbeatable Strategies. IEEE Access 11: 5062-5068 (2023) - [j6]Masahiko Ueda:
Memory-two strategies forming symmetric mutual reinforcement learning equilibrium in repeated prisoners' dilemma game. Appl. Math. Comput. 444: 127819 (2023) - [i10]Masahiko Ueda:
Application of zero-determinant strategies to particle control in statistical physics. CoRR abs/2306.05597 (2023) - 2022
- [j5]Masahiko Ueda:
Controlling Conditional Expectations by Zero-Determinant Strategies. Oper. Res. Forum 3(3) (2022) - [i9]Masahiko Ueda:
Necessary and Sufficient Condition for the Existence of Zero-Determinant Strategies in Repeated Games. CoRR abs/2205.14799 (2022) - [i8]Masahiko Ueda:
Unexploitable games and unbeatable strategies. CoRR abs/2211.02285 (2022) - 2021
- [j4]Yuki Usui, Masahiko Ueda:
Symmetric equilibrium of multi-agent reinforcement learning in repeated prisoner's dilemma. Appl. Math. Comput. 409: 126370 (2021) - [i7]Yuki Usui, Masahiko Ueda:
Symmetric equilibrium of multi-agent reinforcement learning in repeated prisoner's dilemma. CoRR abs/2101.11861 (2021) - [i6]Masahiko Ueda:
Memory-two strategies forming symmetric mutual reinforcement learning equilibrium in repeated prisoner's dilemma game. CoRR abs/2108.03258 (2021) - 2020
- [j3]Masahiko Ueda:
Common knowledge equilibrium of Boolean securities in distributed information market. Appl. Math. Comput. 386: 125540 (2020) - [i5]Masahiko Ueda:
Common knowledge equilibrium of separable securities in distributed information market. CoRR abs/2002.09086 (2020) - [i4]Masahiko Ueda:
Memory-two zero-determinant strategies in repeated games. CoRR abs/2011.06772 (2020) - [i3]Masahiko Ueda:
Controlling conditional expectations by zero-determinant strategies. CoRR abs/2012.10231 (2020)
2010 – 2019
- 2019
- [j2]Masahiko Ueda:
Effect of information asymmetry in Cournot duopoly game with bounded rationality. Appl. Math. Comput. 362 (2019) - 2018
- [i2]Masahiko Ueda, Toshiyuki Tanaka:
Zero-determinant strategies in repeated incomplete-information games: Consistency of payoff relations. CoRR abs/1807.00472 (2018) - [i1]Masahiko Ueda:
Effect of information asymmetry in Cournot duopoly game with bounded rationality. CoRR abs/1809.10865 (2018) - 2014
- [c1]Kenta Matsumoto, Nobutaka Tsujiuchi, Takayuki Koizumi, Akihito Ito, Masahiko Ueda, Kosuke Okazaki:
Dynamic Analysis for Golf Swing using of Mode Synthetics Method for Suggesting an Optimal Club. icSPORTS 2014: 27-33 - 2013
- [j1]Masahiko Ueda, Hiroshi Negoro, Yosuke Kurihara, Kajiro Watanabe:
Measurement of Angular Motion in Golf Swing by a Local Sensor at the Grip End of a Golf Club. IEEE Trans. Hum. Mach. Syst. 43(4): 398-404 (2013)
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-11-19 20:40 CET 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:
