Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Daniel P. Kennedy
Rajesh Vasu
Dan Graur
Barbara Aquilani
Maximilian Dürr
Jhonathan Pinzon
Liangliang Shang
Chen Ma
Antti Vehkaoja
Shekoofeh Azizi
Home
/
Author
/
SYLVAIN BOUVERET
Author Info
Open Visualization
Name
Affiliation
Papers
SYLVAIN BOUVERET
ONERA -- Centre de Toulouse, 2, avenue Édouard Belin, BP74025, 31055 Toulouse Cedex 4, France
24
Collaborators
Citations
PageRank
37
251
17.61
Referers
Referees
References
299
338
229
Search Limit
100
338
Publications (24 rows)
Collaborators (37 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Representing and reasoning about auctions
0
0.34
2022
A General Framework for the Logical Representation of Combinatorial Exchange Protocols
0
0.34
2021
Efficiency, Sequenceability and Deal-Optimality in Fair Division of Indivisible Goods.
0
0.34
2018
Knowledge, Fairness, and Social Constraints.
1
0.35
2018
Chore division on a graph.
0
0.34
2018
Voting by sequential elimination with few voters.
0
0.34
2017
Positional scoring-based allocation of indivisible goods.
5
0.39
2017
Fair Division of a Graph.
11
0.68
2017
Complexity of Manipulating Sequential Allocation.
3
0.39
2017
A programming framework for Spatial Crowdsourcing.
0
0.34
2017
Efficiency and Sequenceability in Fair Division of Indivisible Goods with Additive Preferences.
2
0.39
2016
Manipulating picking sequences.
16
0.84
2014
Characterizing conflicts in fair division of indivisible goods using a scale of criteria.
28
1.43
2014
Scoring Rules for the Allocation of Indivisible Goods.
9
0.54
2014
Fair Division of Indivisible Goods under Risk.
1
0.35
2012
Towards a categorical framework to ensure correct software evolutions
3
0.39
2011
A general elicitation-free protocol for allocating indivisible goods
5
0.72
2011
Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
14
0.87
2010
On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences
20
1.06
2009
Conditional importance networks: a graphical language for representing ordinal, monotonic preferences over sets of goods
23
1.01
2009
Computing leximin-optimal solutions in constraint networks
23
0.97
2009
New constraint programming approaches for the computation of leximin-optimal solutions in constraint networks
4
0.46
2007
Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity
49
2.92
2005
Allocation of indivisible goods: a general model and some complexity results
34
1.83
2005
1
