Skip to Main content Skip to Navigation
Conference papers

Graph Aggregation (Extended Abstract)

Abstract : Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of situations, e.g., when applying a voting rule (graphs as preference orders), when consolidating conflicting views regarding the relationships between arguments in a debate (graphs as abstract argumentation frameworks), or when computing a consensus between several alternative clusterings of a given dataset (graphs as equivalence relations). Other potential applications include belief merging, data integration, and social net-work analysis. In this short paper, we review a recently introduced formal framework for graph aggregation that is grounded in social choice theory. Our focus is on understanding which properties shared by the individual input graphs will transfer to the output graph returned by a given aggregation rule. Our main result is a powerful impossibility theorem that generalises Arrow's seminal result regarding the aggregation of preference orders to a large collection of different types of graphs. We also provide a discussion of existing and potential applications of graph aggregation.
Document type :
Conference papers
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02089268
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Wednesday, April 3, 2019 - 3:49:36 PM
Last modification on : Tuesday, September 8, 2020 - 10:32:02 AM

File

endriss_22668.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02089268, version 1
  • OATAO : 22668

Citation

Ulle Endriss, Umberto Grandi. Graph Aggregation (Extended Abstract). World Wide Web Conference (WWW 2018), Apr 2018, Lyon, France. pp.447-450. ⟨hal-02089268⟩

Share

Metrics

Record views

26

Files downloads

32