default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrés Perea
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j37]Andrés Perea:
Common belief in rationality in games with unawareness. Math. Soc. Sci. 119: 11-30 (2022)- 2020
- [j36]Rubén Becerril-Borja, Andrés Perea:
Common belief in future and restricted past rationality. Int. J. Game Theory 49(3): 711-747 (2020) - 2019
- [j35]Andrés Perea, Arkadi Predtetchinski
:
An epistemic approach to stochastic games. Int. J. Game Theory 48(1): 181-203 (2019) - [j34]Andrés Perea, Elias Tsakas:
Limited focus in dynamic games. Int. J. Game Theory 48(2): 571-607 (2019) - [j33]Geir B. Asheim, Andrés Perea:
Algorithms for cautious reasoning in games. Int. J. Game Theory 48(4): 1241-1275 (2019) - [j32]Giacomo Bonanno, Wiebe van der Hoek, Andrés Perea:
Introduction to the Special Issue on Logic and the Foundations of Game and Decision Theory (LOFT12). Stud Logica 107(3): 451-455 (2019) - 2018
- [j31]Andrés Perea:
Why forward induction leads to the backward induction outcome: A new proof for Battigalli's theorem. Games Econ. Behav. 110: 120-138 (2018) - [j30]Angie Mounir, Andrés Perea, Elias Tsakas:
Common belief in approximate rationality. Math. Soc. Sci. 91: 6-16 (2018) - 2017
- [j29]Andrés Perea, Souvik Roy:
A new epistemic characterization of ε-proper rationalizability. Games Econ. Behav. 104: 309-328 (2017) - [j28]Andrés Perea:
Forward induction reasoning and correct beliefs. J. Econ. Theory 169: 489-516 (2017) - 2016
- [j27]Andrés Perea, Willemien Kets:
When Do Types Induce the Same Belief Hierarchy? Games 7(4): 28 (2016) - [j26]Andrés Perea:
The Language of Game Theory: Putting Epistemics into the Mathematics of Games, by Adam Brandenburger. Games Econ. Behav. 95: 178-181 (2016) - 2015
- [j25]Aviad Heifetz, Andrés Perea:
On the outcome equivalence of backward induction and extensive form rationalizability. Int. J. Game Theory 44(1): 37-59 (2015) - [j24]Topi Miettinen, Andrés Perea:
Commitment in alternating offers bargaining. Math. Soc. Sci. 76: 12-18 (2015) - 2014
- [j23]Andrés Perea:
Belief in the opponents' future rationality. Games Econ. Behav. 83: 231-254 (2014) - [j22]Andrés Perea:
From Classical to Epistemic Game Theory. IGTR 16(1) (2014) - [j21]Christian W. Bach, Andrés Perea:
Utility proportional beliefs. Int. J. Game Theory 43(4): 881-902 (2014) - 2013
- [j20]Christian W. Bach, Andrés Perea:
Agreeing to disagree with lexicographic prior beliefs. Math. Soc. Sci. 66(2): 129-133 (2013) - 2012
- [j19]Bram Driesen, Andrés Perea, Hans Peters:
Alternating offers bargaining with loss aversion. Math. Soc. Sci. 64(2): 103-118 (2012) - 2011
- [j18]János Flesch, Andrés Perea:
Strategic disclosure of random variables. Eur. J. Oper. Res. 209(1): 73-82 (2011) - [j17]Andrés Perea:
An algorithm for proper rationalizability. Games Econ. Behav. 72(2): 510-525 (2011) - [j16]Bram Driesen, Andrés Perea, Hans Peters:
The Kalai-Smorodinsky bargaining solution with loss aversion. Math. Soc. Sci. 61(1): 58-64 (2011) - 2010
- [j15]Andrés Perea:
Backward Induction versus Forward Induction Reasoning. Games 1(3): 168-188 (2010) - 2009
- [j14]János Flesch, Andrés Perea:
Repeated games with voluntary information purchase. Games Econ. Behav. 66(1): 126-145 (2009) - 2008
- [j13]Andrés Perea:
Minimal belief revision leads to backward induction. Math. Soc. Sci. 56(1): 1-26 (2008) - 2007
- [j12]Rudolf Müller, Andrés Perea, Sascha Wolf:
Weak monotonicity and Bayes-Nash incentive compatibility. Games Econ. Behav. 61(2): 344-358 (2007) - [j11]Andrés Perea:
Proper belief revision and equilibrium in dynamic games. J. Econ. Theory 136(1): 572-586 (2007) - [j10]Andrés Perea:
A one-person doxastic characterization of Nash strategies. Synth. 158(2): 251-271 (2007) - 2006
- [j9]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) - [j8]Andrés Perea, Hans Peters, Tim Schulteis, Dries Vermeulen:
Stochastic dominance equilibria in two-person noncooperative games. Int. J. Game Theory 34(4): 457-473 (2006) - [j7]Andrés Perea:
Proper belief revision and rationalizability in dynamic games. Int. J. Game Theory 34(4): 529-559 (2006) - 2005
- [j6]Geir B. Asheim, Andrés Perea:
Sequential and quasi-perfect rationalizability in extensive games. Games Econ. Behav. 53(1): 15-42 (2005) - [j5]Laurence Kranich, Andrés Perea, Hans Peters:
Core Concepts for Dynamic TU Games. IGTR 7(1): 43-61 (2005) - [j4]Antonio Nicolò, Andrés Perea:
Monotonicity and equal-opportunity equivalence in bargaining. Math. Soc. Sci. 49(2): 221-243 (2005) - 2002
- [j3]Andrés Perea:
A note on the one-deviation property in extensive form games. Games Econ. Behav. 40(2): 322-338 (2002) - 2000
- [j2]Andrés Perea y Monsuwé, Mathijs Jansen, Dries Vermeulen:
Player splitting in extensive form games. Int. J. Game Theory 29(3): 433-450 (2000) - 1999
- [j1]János Flesch, Andrés Perea y Monsuwé:
Repeated Games with Endogenous Choice of Information Mechanisms. Math. Oper. Res. 24(4): 785-794 (1999)
Conference and Workshop Papers
- 2003
- [c1]Andrés Perea:
Rationalizability and minimal complexity in dynamic games. TARK 2003: 1-14
Parts in Books or Collections
- 2015
- [p1]Andrés Perea:
Finite Reasoning Procedures for Dynamic Games. Models of Strategic Reasoning 2015: 63-90
Editorship
- 2021
- [e1]Joseph Y. Halpern, Andrés Perea:
Proceedings Eighteenth Conference on Theoretical Aspects of Rationality and Knowledge, TARK 2021, Beijing, China, June 25-27, 2021. EPTCS 335, 2021 [contents]
Informal and Other Publications
- 2005
- [i1]Rudolf Müller, Andrés Perea, Sascha Wolf:
A Network Approach to Bayes-Nash Incentive Compatible Mechanisms. Computing and Markets 2005
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 2025-01-09 12:53 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:
