The degree measure as utility function over positions in graphs and digraphs

DOI10.1016/j.ejor.2021.10.017zbMath1495.91012OpenAlexW3207433627MaRDI QIDQ2670539

Agnieszka Rusinowska, René van den Brink

Publication date: 11 March 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2021.10.017

zbMATH Keywords

weighted graphcooperative gamegroup decisions and negotiationsdegree centralityvon Neumann-Morgenstern expected utility function

Mathematics Subject Classification ID

Decision theory (91B06) Cooperative games (91A12) Individual preferences (91B08) Directed graphs (digraphs), tournaments (05C20) Social choice (91B14)

Related Items (1)

Reconciling business analytics with graphically initialized subspace clustering for optimal nonlinear pricing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Axioms for centrality scoring with principal eigenvectors
• On axiomatizations of the Shapley value for assignment games
• Classification of budget-invariant monotonic preferences
• Sharing a river among satiable agents
• The outflow ranking method for weighted directed graphs
• The Copeland choice function. An axiomatic characterization
• Equal or proportional division of a surplus, and other methods
• Utility functions for simple games
• Ranking methods based on valued preference relations. A characterization of the net flow method
• Ranking methods for valued preference relations: A characterization of a method based on leaving and entering flows
• The Shapley value for \(n\)-person games in generalized characteristic function form
• An alternative proof for the linear utility representation theorem
• On values for generalized characteristic functions
• Centrality and power in social networks: A game theoretic approach.
• Ranking by outdegree for directed graphs
• Mutual rankings
• A characterization of the Shapley value in queueing problems
• Continuous linear representability of binary relations
• The degree ratio ranking method for directed graphs
• Competitive economy as a ranking device over networks
• Local and consistent centrality measures in parameterized networks
• Scoring of web pages and tournaments-axiomatizations
• The centrality index of a graph
• A new status index derived from sociometric analysis
• Marginal Contributions and Externalities in the Value
• Ranking the Participants in a Tournament
• The Shapley Value as a von Neumann-Morgenstern Utility
• On the Complexity of Cooperative Solution Concepts
• A Game Theoretic Approach to Problems in Telecommunication
• A ranking method based on handicaps
• The Measurement of Intellectual Influence
• The Nucleolus of a Characteristic Function Game
• An Axiomatic Approach to Measurable Utility
• Networks

This page was built for publication: The degree measure as utility function over positions in graphs and digraphs