Lê Nguyên Hoang

Lê Nguyên Hoang
École Polytechnique Fédérale de Lausanne | EPFL · Computer Science Section

About

4
Publications
627
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
16
Citations
Citations since 2017
2 Research Items
15 Citations
201720182019202020212022202301234
201720182019202020212022202301234
201720182019202020212022202301234
201720182019202020212022202301234

Publications

Publications (4)
Article
In this paper, we suggest a new approach called the return function to deal with the determination of Bayesian–Nash equilibria in games of incomplete information. Whereas in the traditional approach players reply to each others’ strategies, here each player replies to his own return function. In short, given a player’s choice of action and the othe...
Article
Full-text available
In this paper, we study the strategy-proofness properties of the randomized Condorcet voting system (RCVS). Discovered at several occasions independently, the RCVS is arguably the natural extension of the Condorcet method to cases where a deterministic Condorcet winner does not exists. Indeed, it selects the always-existing and essentially unique C...

Network

Cited By