Pages that link to "Item:Q834855"

The following pages link to Strong equilibrium in cost sharing connection games (Q834855):

Displaying 41 items.

• Optimal cost sharing for capacitated facility location games (Q297094) (← links)
• Cost-sharing scheduling games on restricted unrelated machines (Q306273) (← links)
• Computing pure Nash and strong equilibria in bottleneck congestion games (Q378094) (← links)
• Implementing efficient graphs in connection networks (Q382330) (← links)
• The price of anarchy on uniformly related machines revisited (Q418148) (← links)
• Convergence of best-response dynamics in games with conflicting congestion effects (Q477597) (← links)
• Resource buying games (Q487012) (← links)
• Strong equilibrium in network congestion games: increasing versus decreasing costs (Q495760) (← links)
• Strong Nash equilibrium in games with common and complementary local utilities (Q502326) (← links)
• Competitive cost sharing with economies of scale (Q547291) (← links)
• Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy (Q611044) (← links)
• Price of stability in survivable network design (Q647493) (← links)
• Exact and approximate equilibria for optimal group network formation (Q719269) (← links)
• Inefficiency of equilibria for scheduling game with machine activation costs (Q897948) (← links)
• Capacitated network design games (Q904684) (← links)
• Non-cooperative facility location and covering games (Q964406) (← links)
• Congestion games with linearly independent paths: convergence time and price of anarchy (Q987402) (← links)
• Strong price of anarchy (Q1007765) (← links)
• Efficient graph topologies in network routing games (Q1021587) (← links)
• Computing the strong Nash equilibrium for Markov chains games (Q1664280) (← links)
• Strategic cooperation in cost sharing games (Q1939521) (← links)
• Strategic multiway cut and multicut games (Q1946494) (← links)
• A game-theoretical model of the landscape theory (Q1996175) (← links)
• Pricing traffic in a spanning network (Q2016252) (← links)
• The price of stability for undirected broadcast network design with fair cost allocation is constant (Q2206821) (← links)
• Computing the strong \(L_p\)-Nash equilibrium for Markov chains games: convergence and uniqueness (Q2284447) (← links)
• Quality of strong equilibria for selfish bin packing with uniform cost sharing (Q2304118) (← links)
• Strategic network formation through an intermediary (Q2322712) (← links)
• Pareto optimal equilibria for selfish bin packing with uniform cost sharing (Q2424651) (← links)
• Efficiency analysis of load balancing games with and without activation costs (Q2434275) (← links)
• Approximate strong equilibria in job scheduling games with two uniformly related machines (Q2446828) (← links)
• On the Price of Stability of Undirected Multicast Games (Q2959842) (← links)
• Cost-Sharing Scheduling Games on Restricted Unrelated Machines (Q3449583) (← links)
• Mechanism and Network Design with Private Negative Externalities (Q4604896) (← links)
• Balancing Load via Small Coalitions in Selfish Ring Routing Games (Q5245837) (← links)
• Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy (Q5459970) (← links)
• Approximate Strong Equilibrium in Job Scheduling Games (Q5459972) (← links)
• Cost-sharing games in real-time scheduling systems (Q5925633) (← links)
• Preference revelation games and strict cores of multiple‐type housing market problems (Q6074889) (← links)
• Variational inequalities, Ky Fan minimax inequality; and strong Nash equilibria in generalized games (Q6494312) (← links)
• Arbitrary profit sharing in federated learning utility games (Q6546278) (← links)