An ABC-problem for location and consensus functions on graphs
From MaRDI portal
Recommendations
- A generalization of the graph Laplacian with application to a distributed consensus algorithm
- scientific article; zbMATH DE number 468643
- scientific article; zbMATH DE number 3960894
- A dynamic location problem for graphs
- Strategy-proof location functions on finite graphs
- On locating-domination in graphs
- A note on the complexity of locating-total domination in graphs
Cites work
- scientific article; zbMATH DE number 3697163 (Why is no real title available?)
- scientific article; zbMATH DE number 3794119 (Why is no real title available?)
- scientific article; zbMATH DE number 1394673 (Why is no real title available?)
- A Formal Theory of Consensus
- A survey of sequences of central subgraphs
- A tight axiomatization of the median procedure on median graphs
- An Axiomatic Approach to Location on Networks
- An axiomatic characterization of some locations in trees
- Axiomatic Consensus Theory in Group Choice and Biomathematics
- Axiomatic characterization of the antimedian function on paths and hypercubes
- Axiomatic characterization of the mean function on trees
- Characterizations of the plurality function
- Five axioms for location functions on median graphs
- Handbook of social choice and welfare. Vol. 1.
- Handbook of social choice and welfare. Vol. 2
- Location theory. A unified approach
- Median Graphs and Triangle-Free Graphs
- Social choice and individual values
- The \(\ell_{p}\)-function on trees
- The center function on trees
- The median function on distributive semilattices
- The median procedure in cluster analysis and social choice theory
- The median procedure on median graphs
- What do trees and hypercubes have in common?
Cited in
(10)- A tight axiomatization of the median procedure on median graphs
- Axiomatic characterization of the median and antimedian function on a complete graph minus a matching
- The target location function on finite trees
- The \(t\)-median function on graphs
- Majority rule for profiles of arbitrary length, with an emphasis on the consistency axiom
- Axiomatic characterization of the center function. the case of universal axioms
- ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and \(G^2\)-connected medians
- Axiomatic characterization of the center function. The case of non-universal axioms
- The median function of a block graph: axiomatic characterizations
- Five axioms for location functions on median graphs
This page was built for publication: An ABC-problem for location and consensus functions on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290094)