The following pages link to (Q3002793):
Displaying 25 items.
- Non-cooperative capacitated facility location games (Q318924) (← links)
- Nash equilibria with minimum potential in undirected broadcast games (Q390911) (← links)
- \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games (Q390917) (← links)
- Selfish bin coloring (Q411255) (← links)
- Resource buying games (Q487012) (← links)
- Minimizing Rosenthal potential in multicast games (Q493648) (← links)
- LP-based covering games with low price of anarchy (Q493659) (← links)
- Competitive cost sharing with economies of scale (Q547291) (← links)
- Graphical congestion games (Q639291) (← links)
- Exact and approximate equilibria for optimal group network formation (Q719269) (← links)
- Strategic network formation through peering and service agreements (Q719870) (← links)
- Logit dynamics with concurrent updates for local interaction potential games (Q893316) (← links)
- Non-cooperative facility location and covering games (Q964406) (← links)
- Strategic cooperation in cost sharing games (Q1939521) (← links)
- Strategic multiway cut and multicut games (Q1946494) (← links)
- Pricing traffic in a spanning network (Q2016252) (← links)
- The price of anarchy for network formation in an adversary model (Q2344983) (← links)
- Enforcing efficient equilibria in network design games via subsidies (Q2345938) (← links)
- Efficient Black-Box Reductions for Separable Cost Sharing (Q4991670) (← links)
- (Q5002844) (← links)
- Designing Networks with Good Equilibria under Uncertainty (Q5232329) (← links)
- A Characterization of Undirected Graphs Admitting Optimal Cost Shares (Q5238743) (← links)
- Bottleneck links, variable demand, and the tragedy of the commons (Q5326768) (← links)
- Social distancing network creation (Q6107894) (← links)
- Geometric Network Creation Games (Q6141862) (← links)