Pages that link to "Item:Q3581254"
From MaRDI portal
The following pages link to Pricing network edges for heterogeneous selfish users (Q3581254):
Displaying 32 items.
- On the stability of finding approximate fixed points by simplicial methods (Q314957) (← links)
- A generalized two-agent location problem: Asymmetric dynamics and coordination (Q535058) (← links)
- Existence and computation of optimal tolls in multiclass network equilibrium problems (Q833582) (← links)
- Coordination mechanisms (Q838145) (← links)
- Transfer implementation in congestion games (Q888280) (← links)
- Edge pricing of multicommodity networks for selfish users with elastic demands (Q1014793) (← links)
- Stackelberg strategies for selfish routing in general multicommodity networks (Q1017909) (← links)
- Non-atomic one-round walks in congestion games (Q1731512) (← links)
- Toll caps in privatized road networks (Q1734347) (← links)
- A network pricing game for selfish traffic (Q1954204) (← links)
- Optimal externalities in a parallel transportation network (Q2162683) (← links)
- The minimum tollbooth problem in atomic network congestion games with unsplittable flows (Q2230724) (← 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)
- Demand allocation with latency cost functions (Q2429466) (← links)
- The toll effect on price of anarchy when costs are nonlinear and asymmetric (Q2462125) (← links)
- How much can taxes help selfish routing? (Q2495395) (← links)
- On the severity of Braess's paradox: designing networks for selfish users is hard (Q2496322) (← links)
- Tradeoffs in worst-case equilibria (Q2503349) (← links)
- Linear tolls suffice: new bounds and algorithms for tolls in single source networks (Q2581266) (← links)
- Negative prices in network pricing games (Q2670481) (← links)
- The Cost of Free Spectrum (Q2957452) (← links)
- Stackelberg network pricing is hard to approximate (Q3082599) (← links)
- On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users (Q3162516) (← links)
- Inducing coordination in supply chains through linear reward schemes (Q3423260) (← links)
- Dynamic Coordination of Multiple Agents in a Class of Differential Games Through a Generalized Linear Reward Scheme (Q4979408) (← links)
- (Q5002840) (← links)
- Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators (Q5031023) (← links)
- Wealth Inequality and the Price of Anarchy (Q5090481) (← links)
- Pricing bridges to cross a river (Q5436961) (← links)
- Bertrand Competition in Networks (Q5459973) (← links)
- An incentive compatible, efficient market for air traffic flow management (Q5918109) (← links)