activity
20162026
most citedFair Division of a Graph

10 citations · 14 across the 5 of their papers we have counts for

collaborators
Showing cs.GTShow all

5 papers · 1 filter

cs.GT2026

Computational Social Choice: Research & Development

Dorothea Baumeister, Ratip Emin Berker, Niclas Boehmer +7

Computational social choice (COMSOC) studies principled ways to aggregate conflicting individual preferences into collective decisions. In this paper, we call for an increased effo…

cs.GT20214 cited

A General Framework for the Logical Representation of Combinatorial Exchange Protocols

Munyque Mittelmann, Sylvain Bouveret, Laurent Perrussel

The goal of this paper is to propose a framework for representing and reasoning about the rules governing a combinatorial exchange. Such a framework is at first interest as long as…

cs.GT201710 cited

Fair Division of a Graph

Sylvain Bouveret, Katarína Cechlárová, Edith Elkind +2

We consider fair allocation of indivisible items under an additional constraint: there is an undirected graph describing the relationship between the items, and each agent's share…

cs.GT2016

Efficiency and Sequenceability in Fair Division of Indivisible Goods with Additive Preferences

Sylvain Bouveret, Michel Lemaître

In fair division of indivisible goods, using sequences of sincere choices (or picking sequences) is a natural way to allocate the objects. The idea is the following: at each stage,…

cs.GT2016

Complexity of Manipulating Sequential Allocation

Haris Aziz, Sylvain Bouveret, Jerome Lang +1

Sequential allocation is a simple allocation mechanism in which agents are given pre-specified turns and each agents gets the most preferred item that is still available. It has lo…