default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOlivier Gossner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j19]Michel De Lara
, Olivier Gossner:
Payoffs-Beliefs Duality and the Value of Information. SIAM J. Optim. 30(1): 464-489 (2020)
2010 – 2019
- 2018
- [j18]Olivier Gossner, Jakub Steiner:
On the cost of misperception: General results and behavioral applications. J. Econ. Theory 177: 816-847 (2018) - 2017
- [j17]Antonio Cabrales, Olivier Gossner, Roberto Serrano:
A normalized value for information purchases. J. Econ. Theory 170: 266-288 (2017) - 2016
- [j16]Olivier Gossner, Ori Haimanko, Eilon Solan:
Special issue in honor of Abraham Neyman. Int. J. Game Theory 45(1-2): 3-9 (2016) - [j15]Olivier Gossner, Penélope Hernández, Ron Peretz:
The complexity of interacting automata. Int. J. Game Theory 45(1-2): 461-496 (2016) - 2012
- [j14]Mehmet Ekmekci, Olivier Gossner, Andrea Wilson:
Impermanent types and permanent reputations. J. Econ. Theory 147(1): 162-178 (2012) - 2010
- [j13]Olivier Gossner:
Ability and knowledge. Games Econ. Behav. 69(1): 95-106 (2010) - [j12]Olivier Gossner, Johannes Hörner:
When is the lowest equilibrium payoff in a repeated game equal to the minmax payoff? J. Econ. Theory 145(1): 63-84 (2010)
2000 – 2009
- 2009
- [j11]Olivier Gossner, Rida Laraki, Tristan Tomala:
Informationally optimal correlation. Math. Program. 116(1-2): 147-172 (2009) - [r1]Olivier Gossner, Tristan Tomala:
Repeated Games with Complete Information. Encyclopedia of Complexity and Systems Science 2009: 7616-7630 - 2007
- [j10]Olivier Gossner, Tristan Tomala:
Secret Correlation in Repeated Games with Imperfect Monitoring. Math. Oper. Res. 32(2): 413-424 (2007) - 2006
- [j9]Olivier Gossner, Tristan Tomala:
Empirical Distributions of Beliefs Under Imperfect Observation. Math. Oper. Res. 31(1): 13-30 (2006) - [j8]Olivier Gossner, Penélope Hernández:
Coordination through De Bruijn sequences. Oper. Res. Lett. 34(1): 17-21 (2006) - 2003
- [j7]Olivier Gossner, Nicolas Vieille:
Strategic learning in games with symmetric information. Games Econ. Behav. 42(1): 25-47 (2003) - [j6]Bruno Bassan, Olivier Gossner, Marco Scarsini, Shmuel Zamir:
Positive value of information in games. Int. J. Game Theory 32(1): 17-31 (2003) - [j5]Olivier Gossner, Penélope Hernández:
On the Complexity of Coordination. Math. Oper. Res. 28(1): 127-140 (2003) - 2002
- [j4]Olivier Gossner, Nicolas Vieille:
How to play with a biased coin? Games Econ. Behav. 41(2): 206-226 (2002) - 2001
- [j3]Olivier Gossner, Nicolas Vieille:
Repeated communication through the mechanism and. Int. J. Game Theory 30(1): 41-60 (2001) - 2000
- [j2]Olivier Gossner:
Comparison of Information Structures. Games Econ. Behav. 30(1): 44-63 (2000)
1990 – 1999
- 1996
- [j1]Olivier Gossner:
Overlapping Generation Games with Mixed Strategies. Math. Oper. Res. 21(2): 477-486 (1996)
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-06-10 20:27 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:
