Pages that link to "Item:Q2808835"

The following pages link to On approximate Nash equilibria in network design (Q2808835):

Displaying 19 items.

• Implementing efficient graphs in connection networks (Q382330) (← 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)
• The ring design game with fair cost allocation (Q476847) (← links)
• Price of stability in survivable network design (Q647493) (← links)
• Exact and approximate equilibria for optimal group network formation (Q719269) (← links)
• Strong equilibrium in cost sharing connection games (Q834855) (← links)
• Selfishness, collusion and power of local search for the ADMs minimization problem (Q931111) (← links)
• Non-cooperative tree creation (Q1017908) (← links)
• A non-cooperative game theory approach to cost sharing in networks (Q2067258) (← links)
• Contribution games in networks (Q2429340) (← links)
• On equilibria for ADM minimization games (Q2429352) (← links)
• Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions (Q2657274) (← links)
• Near-optimal network design with selfish agents (Q3002793) (← links)
• Nash Equilibria in Network Facility Location Under Delivered Prices (Q3133415) (← links)
• The Price of Stability for Network Design with Fair Cost Allocation (Q3395046) (← links)
• Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions (Q3460781) (← links)
• Near-optimal network design with selfish agents (Q3581253) (← links)
• (Q4387130) (← links)