The following pages link to (Q3579454):
Displaying 12 items.
- Implementing efficient graphs in connection networks (Q382330) (← links)
- Competitive cost sharing with economies of scale (Q547291) (← links)
- Exact and approximate equilibria for optimal group network formation (Q719269) (← links)
- When ignorance helps: graphical multicast cost sharing games (Q844895) (← links)
- Non-cooperative facility location and covering games (Q964406) (← links)
- State based potential games (Q1932699) (← links)
- Strategic multiway cut and multicut games (Q1946494) (← links)
- Designing fast converging cost sharing methods for multicast transmissions (Q1959383) (← links)
- Dynamics in tree formation games (Q2636765) (← links)
- $\mathcal{NP}$ -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games (Q3599089) (← links)
- Mechanism and Network Design with Private Negative Externalities (Q4604896) (← links)
- Potential Games Are <i>Necessary</i> to Ensure Pure Nash Equilibria in Cost Sharing Games (Q5247620) (← links)