Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaël Le Treust
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[b1]Maël Le Treust:
Coordination et Communication Stratégique. CY Cergy Paris University, France, 2022- [c27]Rony Bou Rouphael, Maël Le Treust:
Strategic Communication with Cost-Dependent Decoders via the Gray-Wyner Network. ITW 2022: 285-290 - [i35]Rony Bou Rouphael, Maël Le Treust:
Strategic Communication with Cost-Dependent Decoders via the Gray-Wyner Network. CoRR abs/2208.09749 (2022) - [i34]Rony Bou Rouphael, Maël Le Treust:
Strategic Communication via Cascade Multiple Description Network. CoRR abs/2210.00533 (2022) - [i33]Nicolas Charpenay, Maël Le Treust, Aline Roumy:
Zero-Error Coding for Computing with Encoder Side-Information. CoRR abs/2211.03649 (2022) - [i32]Maël Le Treust, Tobias J. Oechtering:
Power-Estimation Trade-off of Vector-valued Witsenhausen Counterexample with Causal Decoder. CoRR abs/2211.09200 (2022) - 2021
- [j10]Maël Le Treust, Matthieu R. Bloch
:
State Leakage and Coordination With Causal State Knowledge at the Encoder. IEEE Trans. Inf. Theory 67(2): 805-823 (2021) - [c26]Maël Le Treust, Tobias J. Oechtering:
Continuous Random Variable Estimation is not Optimal for the Witsenhausen Counterexample. ISIT 2021: 1889-1894 - [c25]Maël Le Treust, Tristan Tomala:
Strategic Communication with Decoder Side Information. ISIT 2021: 2696-2701 - [c24]Rony Bou Rouphael, Maël Le Treust:
Strategic Successive Refinement Coding for Bayesian Persuasion with Two Decoders. ITW 2021: 1-6 - [i31]Maël Le Treust, Tobias J. Oechtering:
Continuous Random Variable Estimation is not Optimal for the Witsenhausen Counterexample. CoRR abs/2102.02673 (2021) - [i30]Rony Bou Rouphael, Maël Le Treust:
Strategic Successive Refinement Coding for Bayesian Persuasion with Two Decoders. CoRR abs/2105.06201 (2021) - 2020
- [j9]Giulia Cervia, Laura Luzzi, Maël Le Treust, Matthieu R. Bloch:
Strong Coordination of Signals and Actions Over Noisy Channels With Two-Sided State Information. IEEE Trans. Inf. Theory 66(8): 4681-4708 (2020) - [c23]Nicolas Charpenay, Maël Le Treust:
Zero-Error Coding with a Generator Set of Variable-Length Words. ISIT 2020: 78-83 - [c22]Maël Le Treust, Tristan Tomala:
Point-to-Point Strategic Communication. ITW 2020: 1-5 - [c21]Rony Bou Rouphael, Maël Le Treust:
Impact of Private Observation in the Bayesian Persuasion Game. NetGCooP 2020: 229-238 - [i29]Nicolas Charpenay, Maël Le Treust:
Variable-Length Coding for Zero-Error Channel Capacity. CoRR abs/2001.03523 (2020) - [i28]Maël Le Treust, Tristan Tomala:
Point-to-Point Strategic Communication. CoRR abs/2010.12480 (2020)
2010 – 2019
- 2019
- [j8]Maël Le Treust, Tristan Tomala:
Persuasion with limited communication capacity. J. Econ. Theory 184 (2019) - [c20]Tobias J. Oechtering, Maël Le Treust:
Coordination Coding with Causal Decoder for Vector-valued Witsenhausen Counterexample Setups. ITW 2019: 1-5 - [i27]Maël Le Treust, Tristan Tomala:
Strategic Communication with Side Information at the Decoder. CoRR abs/1911.04950 (2019) - 2018
- [j7]Maël Le Treust, Leszek Szczecinski, Fabrice Labeau:
Rate Adaptation for Secure HARQ Protocols. IEEE Trans. Inf. Forensics Secur. 13(12): 2981-2994 (2018) - [c19]Giulia Cervia, Laura Luzzi, Maël Le Treust, Matthieu R. Bloch:
Strong Coordination over Noisy Channels with Strictly Causal Encoding. Allerton 2018: 519-526 - [c18]Maël Le Treust, Tobias J. Oechtering:
Optimal Control Designs for Vector-valued Witsenhausen Counterexample Setups. Allerton 2018: 532-537 - [i26]Giulia Cervia, Laura Luzzi, Maël Le Treust, Matthieu R. Bloch:
Strong coordination of signals and actions over noisy channels with two-sided state information. CoRR abs/1801.10543 (2018) - [i25]Giulia Cervia, Laura Luzzi, Maël Le Treust, Matthieu R. Bloch:
Polar codes for empirical coordination over noisy channels with strictly causal encoding. CoRR abs/1802.09795 (2018) - [i24]Maël Le Treust, Tristan Tomala:
Information-Theoretic Limits of Strategic Communication. CoRR abs/1807.05147 (2018) - [i23]Giulia Cervia, Laura Luzzi, Maël Le Treust, Matthieu R. Bloch:
Strong Coordination over Noisy Channels with Strictly Causal Encoding. CoRR abs/1809.10934 (2018) - [i22]Maël Le Treust, Matthieu R. Bloch:
State Leakage and Coordination of Actions: Core of the Receiver's Knowledge. CoRR abs/1812.07026 (2018) - 2017
- [j6]Mohammed Jabi, Abdellatif Benyouss, Maël Le Treust, Etienne Pierre-Doray, Leszek Szczecinski:
Adaptive Cross-Packet HARQ. IEEE Trans. Commun. 65(5): 2022-2035 (2017) - [j5]Maël Le Treust:
Joint Empirical Coordination of Source and Channel. IEEE Trans. Inf. Theory 63(8): 5087-5114 (2017) - [c17]Giulia Cervia, Laura Luzzi, Maël Le Treust, Matthieu R. Bloch:
Strong coordination of signals and actions over noisy channels. ISIT 2017: 2835-2839 - [i21]Giulia Cervia, Laura Luzzi, Maël Le Treust, Matthieu R. Bloch:
Strong Coordination of Signals and Actions over Noisy Channels. CoRR abs/1705.05587 (2017) - [i20]Maël Le Treust, Tristan Tomala:
Persuasion with limited communication resources. CoRR abs/1711.04474 (2017) - [i19]Maël Le Treust, Tristan Tomala:
Information Design for Strategic Coordination of Autonomous Devices with Non-Aligned Utilities. CoRR abs/1711.04492 (2017) - 2016
- [j4]Zeina Mheich, Maël Le Treust, Florence Alberge, Pierre Duhamel:
Rate Adaptation for Incremental Redundancy Secure HARQ. IEEE Trans. Commun. 64(2): 765-777 (2016) - [c16]Maël Le Treust, Tristan Tomala:
Information design for strategic coordination of autonomous devices with non-aligned utilities. Allerton 2016: 233-242 - [c15]Maël Le Treust, Matthieu R. Bloch:
Empirical coordination, state masking and state amplification: Core of the decoder's knowledge. ISIT 2016: 895-899 - [c14]Giulia Cervia, Laura Luzzi, Matthieu R. Bloch, Maël Le Treust:
Polar coding for empirical coordination of signals and actions over noisy channels. ITW 2016: 81-85 - [c13]Abdellatif Benyouss, Mohammed Jabi, Maël Le Treust, Leszek Szczecinski:
Joint coding/decoding for multi-message HARQ. WCNC 2016: 1-7 - [i18]Mohammed Jabi, Abdellatif Benyouss, Maël Le Treust, Etienne Pierre-Doray, Leszek Szczecinski:
Adaptive Cross-Packet HARQ. CoRR abs/1606.05182 (2016) - [i17]Giulia Cervia, Laura Luzzi, Matthieu R. Bloch, Maël Le Treust:
Polar Coding for Empirical Coordination of Signals and Actions over Noisy Channels. CoRR abs/1609.06432 (2016) - [i16]Maël Le Treust, Leszek Szczecinski, Fabrice Labeau:
Rate Adaptation for Secure HARQ Protocols. CoRR abs/1611.09143 (2016) - 2015
- [c12]Maël Le Treust:
Empirical coordination with two-sided state information and correlated source and state. ISIT 2015: 466-470 - [c11]Maël Le Treust:
Empirical coordination with channel feedback and strictly causal or causal encoding. ISIT 2015: 471-475 - [i15]Maël Le Treust:
Correlation between Channel State and Information Source with Empirical Coordination Constraint. CoRR abs/1501.05501 (2015) - [i14]Maël Le Treust:
Empirical Coordination with Two-Sided State Information and Correlated Source and State. CoRR abs/1506.04812 (2015) - [i13]Maël Le Treust:
Empirical Coordination with Channel Feedback and Strictly Causal or Causal Encoding. CoRR abs/1506.04814 (2015) - 2014
- [c10]Zeina Mheich, Maël Le Treust, Florence Alberge, Pierre Duhamel, Leszek Szczecinski:
Rate-adaptive secure HARQ protocol for block-fading channels. EUSIPCO 2014: 830-834 - [c9]Maël Le Treust:
Correlation between channel state and information source with empirical coordination constraint. ITW 2014: 272-276 - [i12]Maël Le Treust:
Empirical Coordination for Joint Source-Channel Coding. CoRR abs/1406.4077 (2014) - 2013
- [j3]Maël Le Treust, Samson Lasaulce:
Transforming Monitoring Structures with Resilient Encoders - Application to Repeated Games. Dyn. Games Appl. 3(1): 38-67 (2013) - [j2]Maël Le Treust, Samson Lasaulce, Yezekael Hayel, Gaoning He:
Green Power Control in Cognitive Wireless Networks. IEEE Trans. Veh. Technol. 62(4): 1741-1754 (2013) - [c8]Vineeth S. Varma, Mariem Mhiri, Maël Le Treust, Samson Lasaulce, Abdelaziz Samet:
On the benefits of repeated game models for green cross-layer power control in small cells. BlackSeaCom 2013: 137-141 - [c7]Maël Le Treust, Leszek Szczecinski, Fabrice Labeau:
Secrecy & Rate Adaptation for secure HARQ protocols. ITW 2013: 1-5 - [i11]Maël Le Treust, Samson Lasaulce, Yezekael Hayel, Gaoning He:
Green Power Control in Cognitive Wireless Networks. CoRR abs/1304.4199 (2013) - 2012
- [i10]Maël Le Treust, Samson Lasaulce:
Transforming Monitoring Structures with Resilient Encoders. Application to Repeated Games. CoRR abs/1210.6241 (2012) - [i9]Maël Le Treust, Samson Lasaulce:
Resilient Source Coding. CoRR abs/1210.6334 (2012) - [i8]Maël Le Treust, Abdellatif Zaidi, Samson Lasaulce:
An Achievable Rate Region for the Broadcast Wiretap Channel with Asymmetric Side Information. CoRR abs/1210.6341 (2012) - [i7]Maël Le Treust, Samson Lasaulce:
The price of re-establishing perfect, almost perfect or public monitoring in games with arbitrary monitoring. CoRR abs/1210.6365 (2012) - [i6]Maël Le Treust, Yezekael Hayel, Samson Lasaulce, Mérouane Debbah:
"To sense" or "not to sense" in energy-efficient power control games. CoRR abs/1210.6370 (2012) - [i5]Maël Le Treust, Samson Lasaulce, Mérouane Debbah:
Implicit cooperation in distributed energy-efficient networks. CoRR abs/1210.6398 (2012) - 2011
- [c6]Maël Le Treust, Abdellatif Zaidi, Samson Lasaulce:
An achievable rate region for the broadcast wiretap channel with asymmetric side information. Allerton 2011: 68-75 - [c5]Maël Le Treust, Yezekael Hayel, Samson Lasaulce, Mérouane Debbah:
"To Sense" or "Not to Sense" in Energy-Efficient Power Control Games. GAMENETS 2011: 562-577 - [c4]François Mériaux, Maël Le Treust, Samson Lasaulce, Michel Kieffer:
A stochastic game formulation of energy-efficient power control: Equilibrium utilities and practical strategies. DSP 2011: 1-6 - [c3]Maël Le Treust, Samson Lasaulce:
Resilient source coding. NetGCoop 2011: 1-6 - [c2]Maël Le Treust, Samson Lasaulce:
The price of re-establishing perfect, almost perfect or public monitoring in games with arbitrary monitoring. VALUETOOLS 2011: 548-557 - [i4]François Mériaux, Maël Le Treust, Samson Lasaulce, Michel Kieffer:
A Stochastic Game Formulation of Energy-Efficient Power Control: Equilibrium Utilities and Practical Strategies. CoRR abs/1107.4258 (2011) - [i3]François Mériaux, Maël Le Treust, Samson Lasaulce, Michel Kieffer:
Jeux stochastiques et contrôle de puissance distribué. CoRR abs/1107.4382 (2011) - 2010
- [j1]Maël Le Treust, Samson Lasaulce:
A Repeated Game Formulation of Energy-Efficient Decentralized Power Control. IEEE Trans. Wirel. Commun. 9(9): 2860-2869 (2010) - [i2]Maël Le Treust, Samson Lasaulce:
A Repeated Game Formulation of Energy-Efficient Decentralized Power Control. CoRR abs/1007.5004 (2010) - [i1]Maël Le Treust, Hamidou Tembine, Samson Lasaulce, Mérouane Debbah:
Coverage games in small cells networks. CoRR abs/1011.4366 (2010)
2000 – 2009
- 2009
- [c1]Mehdi Bennis, Maël Le Treust, Samson Lasaulce, Mérouane Debbah, Jorma Lilleberg:
Spectrum sharing games on the interference channel. GAMENETS 2009: 515-522
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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 2023-02-19 23:37 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:
