Pages that link to "Item:Q2581266"

The following pages link to Linear tolls suffice: new bounds and algorithms for tolls in single source networks (Q2581266):

Displayed 11 items.

• Stackelberg thresholds in network routing games or the value of altruism (Q834861) ‎ (← links)
• Optimal externalities in a parallel transportation network (Q2162683) ‎ (← links)
• Improving the price of anarchy for selfish routing via coordination mechanisms (Q2249743) ‎ (← links)
• Achieving target equilibria in network routing games without knowing the latency functions (Q2278946) ‎ (← links)
• Improving selfish routing for risk-averse players (Q2300632) ‎ (← links)
• Collusion in atomic splittable routing games (Q2392243) ‎ (← links)
• Improving Selfish Routing for Risk-Averse Players (Q3460799) ‎ (← links)
• Distributed Learning of Wardrop Equilibria (Q3543331) ‎ (← links)
• On stackelberg pricing with computationally bounded customers (Q4648689) ‎ (← links)
• (Q5002840) ‎ (← links)
• Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators (Q5031023) ‎ (← links)