Pages that link to "Item:Q2575412"
From MaRDI portal
The following pages link to The positional power of nodes in digraphs (Q2575412):
Displaying 20 items.
- Axioms for centrality scoring with principal eigenvectors (Q284377) (← links)
- Harsanyi power solutions for graph-restricted games (Q532510) (← links)
- On incentive compatible competitive selection protocols (Q639276) (← links)
- Development of hierarchy theory for digraphs using concentration theory based on a new type of Lorenz curve (Q1410131) (← links)
- From hierarchies to levels: new solutions for games with hierarchical structure (Q1684130) (← links)
- Accessibility measures to nodes of directed graphs using solutions for generalized cooperative games (Q1935924) (← links)
- Axiomatizations of the \(\beta\) and the score measures in networks (Q2041074) (← links)
- Paired comparisons analysis: an axiomatic approach to ranking methods (Q2247945) (← links)
- A Shapley measure of power in hierarchies (Q2282256) (← links)
- A graph interpretation of the least squares ranking method (Q2340263) (← links)
- Socially structured games (Q2370085) (← links)
- Power measures and solutions for games under precedence constraints (Q2397474) (← links)
- Scoring of web pages and tournaments-axiomatizations (Q2500743) (← links)
- Indirect control and power in mutual control structures (Q2516236) (← links)
- The degree measure as utility function over positions in graphs and digraphs (Q2670539) (← links)
- Networks, Information and Choice (Q2787407) (← links)
- RANKING BY RELATIONAL POWER BASED ON DIGRAPHS (Q3647388) (← links)
- Power on digraphs (Q4553420) (← links)
- On Different Ranking Methods (Q5022152) (← links)
- The probabilistic Harsanyi power solutions for probabilistic graph games (Q6181239) (← links)
