The following pages link to Forming efficient networks (Q1927789):
Displaying 13 items.
- QWERTY is efficient (Q281403) (← links)
- Efficient network structures with separable heterogeneous connection costs (Q529825) (← links)
- An allocation rule for dynamic random network formation processes (Q747347) (← links)
- Efficient networks for a class of games with global spillovers (Q898687) (← links)
- In search of efficient network structures: the needle in the haystack (Q926334) (← links)
- Implementation of weighted values in hierarchical and horizontal cooperation structures (Q1005745) (← links)
- Sharing sequential values in a network (Q1622386) (← links)
- Subscription mechanisms for network formation. (Q1867527) (← links)
- A note on network formation with decay (Q1929488) (← links)
- A strategic implementation of the sequential equal surplus division rule for digraph cooperative games (Q2399306) (← links)
- A strategic implementation of the average tree solution for cycle-free graph games (Q2434245) (← links)
- Bidding for surplus in network allocation problems (Q2469856) (← links)
- Efficient partnership formation in networks (Q5243591) (← links)
