Nathanaël Barrot
6 papers · 2016–2020 · 2 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓
🌍
Conference Polyglot · Bronze
🌉
Interdisciplinary Bridge · Bronze
🧭
Keyword Pioneer
🔥
Unstoppable · Bronze
🚀
Conference Pioneer
Top co-authors
Research topics
Keywords
coalition formation
(3)
hedonic game
(3)
core stability
(2)
complexity analysis
(2)
game theory
(2)
fair allocation
(1)
two-sided matching
(1)
pareto optimal
(1)
strategyproof mechanism
(1)
algorithmic complexity
(1)
unknown agent
(1)
deferred acceptance
(1)
multi-unit auction
(1)
non-wasteful allocation
(1)
matching mechanism
(1)
individual stability
(1)
envy-free partition
(1)
computational complexity
(1)
mechanism design
(1)
stability analysis
(1)
Papers
Strategy-Proof and Non-Wasteful Multi-Unit Auction via Social Network
AAAI 2020
Stable and Envy-free Partitions in Hedonic Games
IJCAI 2019
Unknown Agents in Friends Oriented Hedonic Games: Stability and Complexity
AAAI 2019
Strategyproof and Fair Matching Mechanism for Union of Symmetric M-convex Constraints
IJCAI 2018
Core Stability in Hedonic Games among Friends and Enemies: Impact of Neutrals
IJCAI 2017
Conditional and Sequential Approval Voting on Combinatorial Domains
IJCAI 2016