Pages that link to "Item:Q2469856"
From MaRDI portal
The following pages link to Bidding for surplus in network allocation problems (Q2469856):
Displaying 14 items.
- A solution concept for network games: the role of multilateral interactions (Q319240) (← links)
- An allocation rule for dynamic random network formation processes (Q747347) (← links)
- Implementation of weighted values in hierarchical and horizontal cooperation structures (Q1005745) (← links)
- Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms (Q1038341) (← links)
- Efficient extensions of communication values (Q1639272) (← links)
- Fairness and fairness for neighbors: the difference between the Myerson value and component-wise egalitarian solutions (Q1925896) (← links)
- Bidding against a buyout: implementing the Shapley value and the equal surplus value (Q2164317) (← links)
- Probabilistic network values (Q2243528) (← links)
- Smooth multibidding mechanisms (Q2276545) (← 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)
- Tree solutions and standardness for cycle-free graph games (Q2681825) (← links)
- A Simple Bargaining Procedure for the Myerson Value (Q2867523) (← links)
- Networks, Communication and Hierarchy: Applications to Cooperative Games (Q5057948) (← links)
