Pages that link to "Item:Q2854000"
From MaRDI portal
The following pages link to Cost sharing in networks: some open questions (Q2854000):
Displaying 18 items.
- Sharing the cost of redundant items (Q485785) (← links)
- Strategic sharing of a costly network (Q504401) (← links)
- Sharing the cost of a network: core and core allocations (Q1414428) (← links)
- On cost allocation in hub-like networks (Q1599299) (← links)
- Approximation and collusion in multicast cost sharing (Q1885423) (← links)
- A non-cooperative game theory approach to cost sharing in networks (Q2067258) (← links)
- Axiomatization of the counting rule for cost-sharing with possibly redundant items (Q2125113) (← links)
- Routing-proofness in congestion-prone networks (Q2183993) (← links)
- Knapsack cost sharing (Q2254240) (← links)
- Stable cost sharing in production allocation games (Q2318129) (← links)
- Endowment additivity and the weighted proportional rules for adjudicating conflicting claims (Q2358792) (← links)
- On cost allocation in communication networks (Q3032107) (← links)
- Sharing the Cost of a Capacity Network (Q3169088) (← links)
- Fairness versus efficiency in charging for the use of common facilities (Q4656757) (← links)
- Revenue Sharing in Airline Alliance Networks (Q5013375) (← links)
- Potential Games Are <i>Necessary</i> to Ensure Pure Nash Equilibria in Cost Sharing Games (Q5247620) (← links)
- On cost sharing mechanisms in the network design game (Q5401465) (← links)
- Schedule situations and their cooperative game theoretic representations (Q6565419) (← links)
