default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArkadi Predtetchinski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j28]János Flesch, Arkadi Predtetchinski
, Ville Suomala:
Random Perfect Information Games. Math. Oper. Res. 48(2): 708-727 (2023)- 2022
- [j27]Márton Elekes, János Flesch, Viktor Kiss, Donát Nagy, Márk Poór, Arkadi Predtetchinski:
Games Characterizing Limsup Functions and Baire Class 1 Functions. J. Symb. Log. 87(4): 1459-1473 (2022) - 2021
- [j26]János Flesch, P. Jean-Jacques Herings, Jasmine Maes, Arkadi Predtetchinski:
Subgame Maxmin Strategies in Zero-Sum Stochastic Games with Tolerance Levels. Dyn. Games Appl. 11(4): 704-737 (2021) - [j25]János Flesch, Arkadi Predtetchinski, William D. Sudderth:
Discrete stop-or-go games. Int. J. Game Theory 50(2): 559-579 (2021) - 2020
- [j24]János Flesch, Arkadi Predtetchinski:
Parameterized games of perfect information. Ann. Oper. Res. 287(2): 683-699 (2020) - [j23]P. Jean-Jacques Herings, Andrey Meshalkin, Arkadi Predtetchinski:
Optimality, Equilibrium, and Curb Sets in Decision Problems Without Commitment. Dyn. Games Appl. 10(2): 478-492 (2020) - [j22]Galit Ashkenazi-Golan, János Flesch, Arkadi Predtetchinski, Eilon Solan:
Reachability and Safety Objectives in Markov Decision Processes on Long but Finite Horizons. J. Optim. Theory Appl. 185(3): 945-965 (2020) - 2019
- [j21]Andrés Perea, Arkadi Predtetchinski:
An epistemic approach to stochastic games. Int. J. Game Theory 48(1): 181-203 (2019) - 2018
- [j20]János Flesch, Arkadi Predtetchinski, William D. Sudderth:
Simplifying optimal strategies in limsup and liminf stochastic games. Discret. Appl. Math. 251: 40-56 (2018) - [j19]János Flesch, Arkadi Predtetchinski, William D. Sudderth:
Characterization and simplification of optimal strategies in positive stochastic games. J. Appl. Probab. 55(3): 728-741 (2018) - 2017
- [j18]János Flesch, Arkadi Predtetchinski, Eilon Solan:
Sporadic Overtaking Optimality in Markov Decision Problems. Dyn. Games Appl. 7(2): 212-228 (2017) - [j17]P. Jean-Jacques Herings, Andrey Meshalkin, Arkadi Predtetchinski:
A one-period memory folk theorem for multilateral bargaining games. Games Econ. Behav. 103: 185-198 (2017) - [j16]P. Jean-Jacques Herings, Arkadi Predtetchinski:
Best-Response Cycles in Perfect Information Games. Math. Oper. Res. 42(2): 427-433 (2017) - [j15]János Flesch, Arkadi Predtetchinski:
A Characterization of Subgame-Perfect Equilibrium Plays in Borel Games of Perfect Information. Math. Oper. Res. 42(4): 1162-1179 (2017) - 2016
- [j14]Kutay Cingiz, János Flesch, P. Jean-Jacques Herings, Arkadi Predtetchinski:
Doing it now, later, or never. Games Econ. Behav. 97: 174-185 (2016) - [j13]János Flesch, Arkadi Predtetchinski:
On refinements of subgame perfect \(\epsilon \) -equilibrium. Int. J. Game Theory 45(3): 523-542 (2016) - [j12]János Flesch, Arkadi Predtetchinski:
Subgame-Perfect ϵ-Equilibria in Perfect Information Games with Common Preferences at the Limit. Math. Oper. Res. 41(4): 1208-1221 (2016) - 2015
- [j11]P. Jean-Jacques Herings, Arkadi Predtetchinski:
Bargaining with non-convexities. Games Econ. Behav. 90: 151-161 (2015) - 2014
- [j10]Volker Britz, P. Jean-Jacques Herings, Arkadi Predtetchinski:
On the convergence to the Nash bargaining solution for action-dependent bargaining protocols. Games Econ. Behav. 86: 178-183 (2014) - 2012
- [j9]P. Jean-Jacques Herings, Arkadi Predtetchinski:
Sequential share bargaining. Int. J. Game Theory 41(2): 301-323 (2012) - 2011
- [j8]Arkadi Predtetchinski:
One-dimensional bargaining. Games Econ. Behav. 72(2): 526-543 (2011) - 2010
- [j7]P. Jean-Jacques Herings, Arkadi Predtetchinski:
One-dimensional bargaining with Markov recognition probabilities. J. Econ. Theory 145(1): 189-215 (2010) - [j6]Volker Britz, P. Jean-Jacques Herings, Arkadi Predtetchinski:
Non-cooperative support for the asymmetric Nash bargaining solution. J. Econ. Theory 145(5): 1951-1967 (2010) - 2009
- [j5]Arkadi Predtetchinski:
A general structure theorem for the Nash equilibrium correspondence. Games Econ. Behav. 66(2): 950-958 (2009) - 2008
- [j4]Nizar Allouch, Arkadi Predtetchinski:
On the non-emptiness of the fuzzy core. Int. J. Game Theory 37(2): 203-210 (2008) - 2007
- [j3]Arkadi Predtetchinski:
The strong sequential core for stationary cooperative games. Games Econ. Behav. 61(1): 50-66 (2007) - 2006
- [j2]P. Jean-Jacques Herings, Arkadi Predtetchinski, Andrés Perea:
The Weak Sequential Core for Two-Period Economies. Int. J. Game Theory 34(1): 55-65 (2006) - 2004
- [j1]Arkadi Predtetchinski, P. Jean-Jacques Herings:
A necessary and sufficient condition for non-emptiness of the core of a non-transferable utility game. J. Econ. Theory 116(1): 84-92 (2004)
Informal and Other Publications
- 2021
- [i2]János Flesch, Arkadi Predtetchinski, Ville Suomala:
Random perfect information games. CoRR abs/2104.10528 (2021) - [i1]Galit Ashkenazi-Golan, János Flesch, Arkadi Predtetchinski, Eilon Solan:
Equilibria in Repeated Games with Countably Many Players and Tail-Measurable Payoffs. CoRR abs/2106.03975 (2021)
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:50 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:
