default search action
Andreas Blume
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Andreas Blume, Charles N. Noussair, Bohan Ye:
Fragile meaning - an experiment. J. Econ. Theory 216: 105797 (2024) - [c4]Falko Bause, Andreas Blume, Peter Buchholz, Alexander Puzicha, Alina Timmermann:
Adaption of Stochastic Models (ASMo) - A Tool for Input Modeling -. QEST+FORMATS 2024: 72-89 - 2023
- [j16]Andreas Blume, Ernest K. Lai, Wooyoung Lim:
Mediated talk: An experiment. J. Econ. Theory 208: 105593 (2023) - 2022
- [j15]Andreas Blume, Inga Deimen, Sean Inoue:
Incomplete contracts versus communication. J. Econ. Theory 205: 105544 (2022) - [c3]Peter Buchholz, Andreas Blume:
Dynamic Fault Trees with Correlated Failure Times - Modeling and Efficient Analysis -. SRDS 2022: 201-212 - 2020
- [c2]Andreas Blume, Peter Buchholz, Jan Kriege:
Parallelization of EM-Algorithms for Markovian Arrival Processes. MMB 2020: 173-189 - [c1]Andreas Blume, Peter Buchholz, Clara Scherbaum:
Markovian Arrival Processes in Multi-dimensions. QEST 2020: 175-192
2010 – 2019
- 2019
- [j14]Andreas Blume, Ernest K. Lai, Wooyoung Lim:
Eliciting private information with noise: The case of randomized response. Games Econ. Behav. 113: 356-380 (2019) - 2018
- [j13]Andreas Blume:
Failure of common knowledge of language in common-interest communication games. Games Econ. Behav. 109: 132-155 (2018) - 2012
- [j12]Andreas Blume:
A class of strategy-correlated equilibria in sender-receiver games. Games Econ. Behav. 75(2): 510-517 (2012) - 2010
- [j11]Andreas Blume, Uri Gneezy:
Cognitive forward induction and coordination without common knowledge: An experimental study. Games Econ. Behav. 68(2): 488-511 (2010)
2000 – 2009
- 2009
- [j10]Andreas Blume, Paul Heidhues, Jonathan Lafky, Johannes Münster, Meixia Zhang:
All equilibria of the multi-unit Vickrey auction. Games Econ. Behav. 66(2): 729-741 (2009) - 2007
- [j9]Andreas Blume, Andreas Ortmann:
The effects of costless pre-play communication: Experimental evidence from games with Pareto-ranked equilibria. J. Econ. Theory 132(1): 274-290 (2007) - [j8]Andreas Blume, April M. Franco:
Decentralized learning from failure. J. Econ. Theory 133(1): 504-523 (2007) - 2006
- [j7]Andreas Blume, Paul Heidhues:
Private monitoring in auctions. J. Econ. Theory 131(1): 179-211 (2006) - 2004
- [j6]Andreas Blume, Tone Arnold:
Learning to communicate in cheap-talk games. Games Econ. Behav. 46(2): 240-259 (2004) - [j5]Andreas Blume, Tone Arnold:
Erratum to "Learning to communicate in cheap-talk games": [Games Econ. Behav. 46(2004) 240-259]. Games Econ. Behav. 47(2): 453 (2004) - [j4]Andreas Blume, Paul Heidhues:
All equilibria of the Vickrey auction. J. Econ. Theory 114(1): 170-177 (2004) - 2001
- [j3]Andreas Blume, Douglas V. DeJong, Yong-Gwan Kim, Geoffrey B. Sprinkle:
Evolution of Communication with Partial Common Interest. Games Econ. Behav. 37(1): 79-120 (2001) - 2000
- [j2]Andreas Blume, Uri Gneezy:
An Experimental Investigation of Optimal Learning in Coordination Games. J. Econ. Theory 90(1): 161-172 (2000) - [j1]Andreas Blume:
Coordination and Learning with a Partial Language. J. Econ. Theory 95(1): 1-36 (2000)
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-04 20:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint