default search action
Jean-François Laslier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j21]Jean-François Laslier
:
Universalization and altruism. Soc. Choice Welf. 60(4): 579-594 (2023) - 2022
- [c3]Théo Delemazure, Jérôme Lang, Jean-François Laslier, M. Remzi Sanver:
Approval with Runoff. IJCAI 2022: 230-236 - [i7]Théo Delemazure, Jérôme Lang, Jean-François Laslier, M. Remzi Sanver:
Approval with Runoff. CoRR abs/2203.02343 (2022) - 2021
- [j20]Mario Chater, Luc Arrondel, Jean-Pascal Gayant, Jean-François Laslier
Fixing match-fixing: Optimal schedules to promote competitiveness. Eur. J. Oper. Res. 294(2): 673-683 (2021) - [j19]Jean-François Laslier, Matías Núñez, M. Remzi Sanver:
A solution to the two-person implementation problem. J. Econ. Theory 194: 105261 (2021)
2010 – 2019
- 2019
- [p1]Jean-François Laslier
Experiments on the Reaction of Citizens to New Voting Rules: A Survey. The Future of Digital Democracy 2019: 14-23 - [i6]Edith Elkind, Piotr Faliszewski, Jean-François Laslier, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
What Do Multiwinner Voting Rules Do? An Experiment Over the Two-Dimensional Euclidean Domain. CoRR abs/1901.09217 (2019) - 2017
- [j18]Jean-François Laslier
Reaching consensus through approval bargaining. Games Econ. Behav. 104: 241-251 (2017) - [j17]Alessandra Casella, Jean-François Laslier
Democracy for Polarized Committees: The Tale of Blotto's Lieutenants. Games Econ. Behav. 106: 239-259 (2017) - [j16]Jean-François Laslier
Introduction to the special issue in honor of Hervé Moulin. Math. Soc. Sci. 90: 1 (2017) - [c2]Markus Brill, Jean-François Laslier, Piotr Skowron:
Multiwinner Approval Rules as Apportionment Methods. AAAI 2017: 414-420 - [c1]Edith Elkind, Piotr Faliszewski, Jean-François Laslier, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
What Do Multiwinner Voting Rules Do? An Experiment Over the Two-Dimensional Euclidean Domain. AAAI 2017: 494-501 - 2016
- [j15]Jean-François Laslier
Strategic voting in multi-winner elections with approval balloting: a theory for large electorates. Soc. Choice Welf. 47(3): 559-587 (2016) - [i5]Piotr Faliszewski, Jean-François Laslier, Robert Schaefer, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Modeling Representation of Minorities Under Multiwinner Voting Rules. CoRR abs/1604.02364 (2016) - [i4]Markus Brill, Jean-François Laslier, Piotr Skowron:
Multiwinner Approval Rules as Apportionment Methods. CoRR abs/1611.08691 (2016) - 2014
- [j14]Matías Núñez, Jean-François Laslier
Preference intensity representation: strategic overstating in large elections. Soc. Choice Welf. 42(2): 313-340 (2014) - 2013
- [i3]Benoit Laslier, Jean-François Laslier:
Reinforcement learning from comparisons: Three alternatives is enough, two is not. CoRR abs/1301.5734 (2013) - 2012
- [j13]Jean-François Laslier
Introduction to the Special Issue 'Around the Cambridge Compromise: Apportionment in theory and practice'. Math. Soc. Sci. 63(2): 65-67 (2012) - [j12]Jean-François Laslier
Why not proportional? Math. Soc. Sci. 63(2): 90-93 (2012) - 2010
- [j11]Karine Van der Straeten, Jean-François Laslier
Strategic, sincere, and heuristic voting under four election rules: an experimental study. Soc. Choice Welf. 35(3): 435-472 (2010) - [e1]Felix Brandt, Vincent Conitzer, Lane A. Hemaspaandra, Jean-François Laslier, William S. Zwicker:
Computational Foundations of Social Choice, 07.03. - 12.03.2010. Dagstuhl Seminar Proceedings 10101, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i2]Felix Brandt, Vincent Conitzer, Lane A. Hemaspaandra, Jean-François Laslier, William S. Zwicker:
10101 Abstracts Collection - Computational Foundations of Social Choice. Computational Foundations of Social Choice 2010 - [i1]Felix Brandt, Vincent Conitzer, Lane A. Hemaspaandra, Jean-François Laslier, William S. Zwicker:
10101 Executive Summary - Computational Foundations of Social Choice. Computational Foundations of Social Choice 2010
2000 – 2009
- 2006
- [j10]Francesco De Sinopoli, Bhaskar Dutta, Jean-François Laslier
Approval voting: three examples. Int. J. Game Theory 35(1): 27-38 (2006) - 2005
- [j9]Jean-François Laslier
A reinforcement learning process in extensive form games. Int. J. Game Theory 33(2): 219-227 (2005) - [j8]Jean-François Laslier:
Editorial. Math. Soc. Sci. 50(1): 1-2 (2005) - 2003
- [j7]Jean-François Laslier
Analysing a preference and approval profile. Soc. Choice Welf. 20(2): 229-242 (2003) - 2002
- [j6]Jean-François Laslier
Distributive Politics and Electoral Competition. J. Econ. Theory 103(1): 106-130 (2002) - 2001
- [j5]Jean-François Laslier
A Behavioral Learning Process in Games. Games Econ. Behav. 37(2): 340-366 (2001) - 2000
- [j4]Jean-François Laslier:
Aggregation of preferences with a variable set of alternatives. Soc. Choice Welf. 17(2): 269-282 (2000) - [j3]Jean-François Laslier:
Interpretation of electoral mixed strategies. Soc. Choice Welf. 17(2): 283-292 (2000) - [j2]Nicolas Gravel, Jean-François Laslier, Alain Trannoy:
Consistency between tastes and values: A universalization approach. Soc. Choice Welf. 17(2): 293-320 (2000)
1990 – 1999
- 1994
- [j1]Gilbert Laffond, Jean-François Laslier
The Copeland Measure of Condorcet Choice Functions. Discret. Appl. Math. 55(3): 273-279 (1994)
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-04-24 23: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: