Francesco Scarcello
5 papers · 2013–2024 · 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
๐
Academic Marathon ยท Half
๐
Interdisciplinary Bridge ยท Bronze
๐ฃ
Hot Topic Early Bird
๐
Conference Pioneer
Top co-authors
Research topics
Keywords
computational complexity
(2)
fair allocation
(2)
graph structure
(1)
graph connectivity
(1)
shapley value
(1)
fair division
(1)
social welfare
(1)
maximin share
(1)
algorithmic game theory
(1)
maxileximin allocation
(1)
envy minimization
(1)
connected good
(1)
connected fair division
(1)
coalitional game
(1)
matching game
(1)
combinatorial optimization
(1)
connected subset
(1)
graph theory
(1)
Papers
Maxileximin Envy Allocations and Connected Goods
AAAI 2024
The Complexity of Computing Maximin Share Allocations on Graphs
AAAI 2020
The Tractability of the Shapley Value over Bounded Treewidth Matching Games
IJCAI 2017
Structural Tractability of Shapley and Banzhaf Values in Allocation Games
IJCAI 2015
Constraint Satisfaction and Fair Multi-Objective Optimization Problems: Foundations, Complexity, and Islands of Tractability
IJCAI 2013