33 citations · 242 across the 67 of their papers we have counts for
5 papers · 1 filter
On a conjecture of Mohar concerning Kempe equivalence of regular graphs
Marthe Bonamy, Nicolas Bousquet, Carl Feghali +1
Let be a graph with a vertex colouring . Let and be two colours. Then a connected component of the subgraph induced by those vertices coloured either or is k…
Welfare and Rationality Guarantees for the Simultaneous Multiple-Round Ascending Auction
Nicolas Bousquet, Yang Cai, Adrian Vetta
The simultaneous multiple-round auction (SMRA) and the combinatorial clock auction (CCA) are the two primary mechanisms used to sell bandwidth. Under truthful bidding, the SMRA is…
On the Economic Efficiency of the Combinatorial Clock Auction
Nicolas Bousquet, Yang Cai, Christoph Hunkenschröder +1
Since the 1990s spectrum auctions have been implemented world-wide. This has provided for a practical examination of an assortment of auction mechanisms and, amongst these, two sim…
Colorful paths for 3-chromatic graphs
Bessy Stéphane, Bousquet Nicolas
In this paper, we prove that every 3-chromatic connected graph, except , admits a 3-vertex coloring in which every vertex is the beginning of a 3-chromatic path. It is a speci…
Coalition Games on Interaction Graphs: A Horticultural Perspective
Nicolas Bousquet, Zhentao Li, Adrian Vetta
We examine cooperative games where the viability of a coalition is determined by whether or not its members have the ability to communicate amongst themselves independently of non-…