default search action
Jérôme Renault
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j31]Fabien Gensbittel, Dana Pizarro
, Jérôme Renault:
Competition and Recall in Selection Problems. Dyn. Games Appl. 14(4): 806-845 (2024) - [j30]Frédéric Koessler
Splitting games over finite sets. Math. Program. 203(1): 477-498 (2024) - [i6]Maurizio d'Andrea, Fabien Gensbittel, Jérôme Renault:
Games played by Exponential Weights Algorithms. CoRR abs/2407.06676 (2024) - 2021
- [j29]Françoise Forges
Strategic information transmission with sender's approval. Int. J. Game Theory 50(2): 475-502 (2021) - [i5]Fabien Gensbittel, Dana Pizarro, Jérôme Renault:
On a Competitive Selection Problem. CoRR abs/2108.04501 (2021) - 2020
- [j28]Jérôme Renault
Hidden stochastic games and limit equilibrium payoffs. Games Econ. Behav. 124: 122-139 (2020) - [j27]Jérôme Renault, Bruno Ziliotto
Limit Equilibrium Payoffs in Stochastic Games. Math. Oper. Res. 45(3): 889-895 (2020) - [j26]Rida Laraki
Acyclic Gambling Games. Math. Oper. Res. 45(4): 1237-1257 (2020) - [j25]Rainer Buckdahn, Juan Li, Marc Quincampoix
Representation Formulas for Limit Values of Long Run Stochastic Optimal Controls. SIAM J. Control. Optim. 58(4): 1846-1873 (2020) - [i4]Françoise Forges, Jérôme Renault:
Strategic information transmission with sender's approval. CoRR abs/2001.07413 (2020)
2010 – 2019
- 2018
- [j24]Fabien Gensbittel, Stefano Lovo, Jérôme Renault, Tristan Tomala:
Zero-sum revision games. Games Econ. Behav. 108: 504-522 (2018) - 2017
- [j23]Jérôme Renault, Eilon Solan
Optimal dynamic information provision. Games Econ. Behav. 104: 329-349 (2017) - [j22]Jérôme Renault, Xavier Venel:
Long-Term Values in Markov Decision Processes and Repeated Games, and a New Distance for Probability Spaces. Math. Oper. Res. 42(2): 349-376 (2017) - 2016
- [j21]Joyee Deb, Julio González-Díaz
Uniform folk theorems in repeated anonymous random matching games. Games Econ. Behav. 100: 1-23 (2016) - 2015
- [j20]Fabien Gensbittel, Jérôme Renault:
The Value of Markov Chain Games with Incomplete Information on Both Sides. Math. Oper. Res. 40(4): 820-841 (2015) - 2014
- [j19]Jérôme Renault, Ludovic Renou
Secure message transmission on directed networks. Games Econ. Behav. 85: 1-18 (2014) - [i3]Hugo Gimbert, Jérôme Renault, Sylvain Sorin, Xavier Venel, Wieslaw Zielonka:
On the values of repeated games with signals. CoRR abs/1406.4248 (2014) - [i2]Jérôme Renault, Bruno Ziliotto:
Hidden Stochastic Games and Limit Equilibrium Payoffs. CoRR abs/1407.3028 (2014) - 2013
- [j18]Jérôme Renault, Eilon Solan
Dynamic sender-receiver games. J. Econ. Theory 148(2): 502-534 (2013) - 2012
- [j17]Jérôme Renault:
The Value of Repeated Games with an Informed Controller. Math. Oper. Res. 37(1): 154-179 (2012) - [i1]Jérôme Renault, Eilon Solan, Nicolas Vieille:
Dynamic Sender-Receiver Games. CoRR abs/1204.0323 (2012) - 2011
- [j16]Jérôme Renault, Tristan Tomala:
General Properties of Long-Run Supergames. Dyn. Games Appl. 1(2): 319 (2011) - [j15]Marc Quincampoix
On the Existence of a Limit Value in Some Nonexpansive Optimal Control Problems. SIAM J. Control. Optim. 49(5): 2118-2132 (2011)
2000 – 2009
- 2009
- [r1]Jérôme Renault:
Repeated Games with Incomplete Information. Encyclopedia of Complexity and Systems Science 2009: 7630-7651 - 2008
- [j14]Jérôme Renault, Tristan Tomala:
Probabilistic Reliability and Privacy of Communication Using Multicast in General Neighbor Networks. J. Cryptol. 21(2): 250-279 (2008) - [j13]Jérôme Renault, Sergio Scarlatti
Discounted and finitely repeated minority games with public signals. Math. Soc. Sci. 56(1): 44-74 (2008) - [j12]Jérôme Renault, Marco Scarsini
Playing off-line games with bounded rationality. Math. Soc. Sci. 56(2): 207-223 (2008) - 2007
- [j11]Jérôme Renault, Marco Scarsini
A Minority Game with Bounded Recall. Math. Oper. Res. 32(4): 873-889 (2007) - 2006
- [j10]Jérôme Renault:
The Value of Markov Chain Games with Lack of Information on One Side. Math. Oper. Res. 31(3): 490-512 (2006) - 2005
- [j9]Jérôme Renault, Sergio Scarlatti
A folk theorem for minority games. Games Econ. Behav. 53(2): 208-230 (2005) - 2004
- [j8]Jérôme Renault:
View-obstruction: a shorter proof for 6 lonely runners. Discret. Math. 287(1-3): 93-101 (2004) - [j7]Sylvain Gravier, Frédéric Maffray, Jérôme Renault, Nicolas Trotignon:
Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets. Eur. J. Comb. 25(5): 719-734 (2004) - [j6]Jérôme Renault, Tristan Tomala:
Learning the state of nature in repeated games with incomplete information and signals. Games Econ. Behav. 47(1): 124-156 (2004) - [j5]Jérôme Renault, Tristan Tomala:
Communication equilibrium payoffs in repeated games with imperfect monitoring. Games Econ. Behav. 49(2): 313-344 (2004) - 2001
- [j4]Jérôme Renault:
3-player repeated games with lack of information on one side. Int. J. Game Theory 30(2): 221-245 (2001) - [j3]Jérôme Renault:
Learning Sets in State Dependent Signalling Game Forms: A Characterization. Math. Oper. Res. 26(4): 832-850 (2001) - 2000
- [j2]Jérôme Renault:
On Two-Player Repeated Games with Lack of Information on One Side and State-Independent Signalling. Math. Oper. Res. 25(4): 552-572 (2000)
1990 – 1999
- 1998
- [j1]Jérôme Renault, Tristan Tomala:
Repeated proximity games. Int. J. Game Theory 27(4): 539-559 (1998)
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-07 21:19 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: