default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNathanaël Barrot
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c12]Tomoya Sugahara, Kaito Yamashita, Nathanaël Barrot
, Miyuki Koshimura, Makoto Yokoo:
Robust Weighted Partial Maximum Satisfiability Problem: Challenge to σ2P-Complete Problem. PRICAI (1) 2022: 17-31- 2020
- [j2]Kentaro Yahiro, Yuzhe Zhang, Nathanaël Barrot, Makoto Yokoo:
Strategyproof and fair matching mechanism for ratio constraints. Auton. Agents Multi Agent Syst. 34(1): 23 (2020) - [c11]Takehiro Kawasaki, Nathanaël Barrot, Seiji Takanashi, Taiki Todo, Makoto Yokoo:
Strategy-Proof and Non-Wasteful Multi-Unit Auction via Social Network. AAAI 2020: 2062-2069 - [c10]Nathanaël Barrot, Sylvaine Lemeilleur, Nicolas Paget, Abdallah Saffidine:
Peer Reviewing in Participatory Guarantee Systems: Modelisation and Algorithmic Aspects. AAMAS 2020: 114-122
2010 – 2019
- 2019
- [c9]Nathanaël Barrot, Kazunori Ota, Yuko Sakurai, Makoto Yokoo:
Unknown Agents in Friends Oriented Hedonic Games: Stability and Complexity. AAAI 2019: 1756-1763 - [c8]Nathanaël Barrot, Makoto Yokoo:
Stable and Envy-free Partitions in Hedonic Games. IJCAI 2019: 67-73 - [i1]Takehiro Kawasaki, Nathanaël Barrot, Seiji Takanashi, Taiki Todo, Makoto Yokoo:
Strategy-Proof and Non-Wasteful Multi-Unit Auction via Social Network. CoRR abs/1911.08809 (2019) - 2018
- [c7]Kentaro Yahiro, Yuzhe Zhang, Nathanaël Barrot, Makoto Yokoo:
Strategyproof and Fair Matching Mechanism for Ratio Constraints. AAMAS 2018: 59-67 - [c6]Yuzhe Zhang, Kentaro Yahiro, Nathanaël Barrot, Makoto Yokoo:
Strategyproof and Fair Matching Mechanism for Union of Symmetric M-convex Constraints. IJCAI 2018: 590-596 - 2017
- [c5]Nathanaël Barrot, Jérôme Lang, Makoto Yokoo:
Manipulation of Hamming-based Approval Voting for Multiple Referenda and Committee Elections. AAMAS 2017: 597-605 - [c4]Kazunori Ohta, Nathanaël Barrot, Anisse Ismaili, Yuko Sakurai, Makoto Yokoo:
Core Stability in Hedonic Games among Friends and Enemies: Impact of Neutrals. IJCAI 2017: 359-365 - 2016
- [b1]Nathanaël Barrot:
Sur les aspects computationnels du vote par approbation. (Computational Aspects of Approval Voting). PSL Research University, Paris, France, 2016 - [c3]Nathanaël Barrot, Jérôme Lang:
Conditional and Sequential Approval Voting on Combinatorial Domains. IJCAI 2016: 88-94 - 2015
- [j1]Nathanaël Barrot, Jérôme Lang, Bernard Ries:
Vote par approbation pour les élections à vainqueurs multiples. Une famille générale de règles, leur complexité algorithmique et leur manipulabilité. Rev. d'Intelligence Artif. 29(3-4): 265-291 (2015) - [c2]Georgios Amanatidis, Nathanaël Barrot, Jérôme Lang, Evangelos Markakis, Bernard Ries:
Multiple Referenda and Multiwinner Elections Using Hamming Distances: Complexity and Manipulability. AAMAS 2015: 715-723 - 2013
- [c1]Nathanaël Barrot, Laurent Gourvès, Jérôme Lang, Jérôme Monnot, Bernard Ries:
Possible Winners in Approval Voting. ADT 2013: 57-70
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 2025-01-09 13:27 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:
