Pages that link to "Item:Q5901056"
From MaRDI portal
The following pages link to The price of anarchy is independent of the network topology (Q5901056):
Displaying 27 items.
- Efficient methods for selfish network design (Q442104) (← links)
- Inefficiency of logit-based stochastic user equilibrium in a traffic network under ATIS (Q542097) (← links)
- Connectivity and equilibrium in random games (Q549865) (← links)
- Program equilibrium (Q705874) (← links)
- Strong equilibrium in cost sharing connection games (Q834855) (← links)
- Capacitated network design games (Q904684) (← links)
- The price of anarchy of serial, average and incremental cost sharing (Q934898) (← links)
- Sensitivity of Wardrop equilibria (Q987396) (← links)
- An efficient and almost budget balanced cost sharing method (Q993789) (← links)
- Almost budget-balanced VCG mechanisms to assign multiple objects (Q1001816) (← links)
- The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions (Q1006047) (← links)
- Efficient graph topologies in network routing games (Q1021587) (← links)
- The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands. (Q1400339) (← links)
- Bounding the inefficiency of equilibria in nonatomic congestion games (Q1885439) (← links)
- A network pricing game for selfish traffic (Q1954204) (← links)
- Bounding the inefficiency of the C-logit stochastic user equilibrium assignment (Q2014426) (← links)
- On cost sharing in the provision of a binary and excludable public good (Q2254034) (← links)
- Adversarial behavior in network games (Q2342743) (← links)
- Wary of the worst: maximizing award guarantees when new claimants may arrive (Q2411533) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- Selfish unsplittable flows (Q2581267) (← links)
- Worst-case Nash equilibria in restricted routing (Q2637289) (← links)
- Anarchy Is Free in Network Creation (Q2938033) (← links)
- Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games (Q3162508) (← links)
- A Selective Tour Through Congestion Games (Q3464474) (← links)
- Sensitivity of Wardrop Equilibria (Q5459981) (← links)
- Delayed packing attack and countermeasure against transaction information based applications (Q6059604) (← links)
