default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbraham Neyman
Person information
- affiliation: Hebrew University, Jerusalem, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j29]Abraham Neyman:
A Course on Stochastic Game Theory, by Eilon Solan, Cambridge University Press, 2022. Games Econ. Behav. 142: 1043-1044 (2023)- [j28]Kristoffer Arnsfelt Hansen
, Rasmus Ibsen-Jensen, Abraham Neyman:
The Big Match with a Clock and a Bit of Memory. Math. Oper. Res. 48(1): 419-432 (2023) - 2021
- [j27]Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Abraham Neyman:
Absorbing games with a clock and two bits of memory. Games Econ. Behav. 128: 213-230 (2021) - 2020
- [j26]René Levínský, Abraham Neyman, Miroslav Zelený:
Should I remember more than you? Best responses to factored strategies. Int. J. Game Theory 49(4): 1105-1124 (2020)
2010 – 2019
- 2018
- [j25]Elon Kohlberg, Abraham Neyman:
Games of threats. Games Econ. Behav. 108: 139-145 (2018) - [c2]Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Abraham Neyman:
The Big Match with a Clock and a Bit of Memory. EC 2018: 149-150 - 2017
- [j24]Abraham Neyman:
Continuous-time stochastic games. Games Econ. Behav. 104: 92-130 (2017) - 2014
- [j23]Gilad Bavly, Abraham Neyman:
Online concealed correlation and bounded rationality. Games Econ. Behav. 88: 71-89 (2014) - 2013
- [j22]Abraham Neyman:
Stochastic Games with Short-Stage Duration. Dyn. Games Appl. 3(2): 236-278 (2013) - 2012
- [j21]Abraham Neyman:
The value of two-person zero-sum repeated games with incomplete information and uncertain duration. Int. J. Game Theory 41(1): 195-207 (2012) - 2010
- [j20]Abraham Neyman, Joel Spencer:
Complexity and effective prediction. Games Econ. Behav. 69(1): 165-168 (2010) - [j19]Abraham Neyman, Sylvain Sorin:
Repeated games with public uncertain duration process. Int. J. Game Theory 39(1-2): 29-52 (2010)
2000 – 2009
- 2009
- [j18]Abraham Neyman, Daijiro Okada:
Growth of strategy sets, entropy, and nonstationary bounded recall. Games Econ. Behav. 66(1): 404-425 (2009) - [j17]Jean-François Mertens, Abraham Neyman, Dinah Rosenberg:
Absorbing Games with Compact Action Spaces. Math. Oper. Res. 34(2): 257-262 (2009) - 2008
- [j16]Abraham Neyman:
Existence of optimal strategies in Markov games with incomplete information. Int. J. Game Theory 37(4): 581-596 (2008) - 2006
- [c1]Abraham Neyman:
Recent Developments in Learning and Competition with Finite Automata (Extended Abstract). WINE 2006: 1-2 - 2004
- [j15]Abraham Neyman, Rann Smorodinsky:
Asymptotic Values of Vector Measure Games. Math. Oper. Res. 29(4): 739-775 (2004) - 2003
- [j14]Jean-François Mertens, Abraham Neyman:
A value on 'AN. Int. J. Game Theory 32(1): 109-120 (2003) - 2000
- [j13]Abraham Neyman, Daijiro Okada:
Repeated Games with Bounded Entropy. Games Econ. Behav. 30(2): 228-247 (2000) - [j12]Abraham Neyman, Daijiro Okada:
Two-person repeated games with finite automata. Int. J. Game Theory 29(3): 309-325 (2000)
1990 – 1999
- 1998
- [j11]Abraham Neyman, Sylvain Sorin:
Equilibria in repeated games of incomplete information: The general symmetric case. Int. J. Game Theory 27(2): 201-210 (1998) - [j10]Abraham Neyman:
Finitely Repeated Games with Finite Automata. Math. Oper. Res. 23(3): 513-552 (1998) - 1997
- [j9]Abraham Neyman:
Correlated equilibrium and potential games. Int. J. Game Theory 26(2): 223-227 (1997)
1980 – 1989
- 1988
- [j8]Abraham Neyman:
Weighted Majority Games Have Asymptotic Value. Math. Oper. Res. 13(4): 556-580 (1988) - 1985
- [j7]Abraham Neyman:
Semivalues of Political Economic Games. Math. Oper. Res. 10(3): 390-402 (1985) - 1984
- [j6]Leonard J. Mirman, Abraham Neyman:
Diagonality of Cost Allocation Prices. Math. Oper. Res. 9(1): 66-74 (1984) - 1981
- [j5]Pradeep Dubey, Abraham Neyman, Robert James Weber:
Value Theory Without Efficiency. Math. Oper. Res. 6(1): 122-128 (1981) - [j4]Abraham Neyman:
Singular Games have Asymptotic Values. Math. Oper. Res. 6(2): 205-212 (1981)
1970 – 1979
- 1979
- [j3]Abraham Neyman, Yair Tauman:
The Partition Value. Math. Oper. Res. 4(3): 236-264 (1979) - 1977
- [b1]Abraham Neyman:
ערכים למשחקים עם רצף של שחקנים (Values of games with a continuum of players.). Hebrew University of Jerusalem, Israel, 1977 - [j2]Abraham Neyman:
Continuous Values are Diagonal. Math. Oper. Res. 2(4): 338-342 (1977) - 1976
- [j1]Abraham Neyman, Yair Tauman:
The Existence of Nondiagonal Axiomatic Values. Math. Oper. Res. 1(3): 246-250 (1976)
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-05-08 21:41 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:
