Pages that link to "Item:Q2495395"
From MaRDI portal
The following pages link to How much can taxes help selfish routing? (Q2495395):
Displaying 49 items.
- Selfish routing in public services (Q146294) (← links)
- Network design to anticipate selfish evacuation routing (Q339932) (← links)
- Approximating Wardrop equilibria with finitely many agents (Q352247) (← links)
- Nonpreemptive coordination mechanisms for identical machines (Q372964) (← links)
- Efficient methods for selfish network design (Q442104) (← links)
- Maximizing social welfare in congestion games via redistribution (Q495653) (← links)
- A selfish routing based network improvement problem (Q545450) (← links)
- Topological implications of selfish neighbor selection in unstructured peer-to-peer networks (Q639277) (← links)
- Truthful mechanisms for selfish routing and two-parameter agents (Q647482) (← links)
- Mechanisms for (mis)allocating scientific credit (Q832517) (← links)
- Stackelberg thresholds in network routing games or the value of altruism (Q834861) (← links)
- Coordination mechanisms (Q838145) (← links)
- Adaptive routing with stale information (Q838148) (← links)
- Transfer implementation in congestion games (Q888280) (← links)
- Non-cooperative cost sharing games via subsidies (Q987398) (← links)
- Price of anarchy in parallel processing (Q991788) (← links)
- Coordination mechanisms for selfish scheduling (Q1014630) (← links)
- Edge pricing of multicommodity networks for selfish users with elastic demands (Q1014793) (← links)
- Non-atomic one-round walks in congestion games (Q1731512) (← links)
- Price of anarchy in a linear-state stochastic dynamic game (Q1751708) (← links)
- A network pricing game for selfish traffic (Q1954204) (← links)
- Equilibrium strategies for multiple interdictors on a common network (Q2028891) (← links)
- Market inefficiency, entry order and coordination (Q2079290) (← links)
- Beyond Pigouvian taxes: a worst case analysis (Q2152117) (← links)
- A traffic congestion analysis by user equilibrium and system optimum with incomplete information (Q2156302) (← links)
- Optimal externalities in a parallel transportation network (Q2162683) (← links)
- Optimal control of the mean field equilibrium for a pedestrian tourists' flow model (Q2172743) (← 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)
- The price of anarchy of affine congestion games with similar strategies (Q2285160) (← links)
- Enforcing efficient equilibria in network design games via subsidies (Q2345938) (← links)
- Efficient coordination mechanisms for unrelated machine scheduling (Q2375956) (← links)
- Efficiency and complexity of price competition among single-product vendors (Q2407455) (← links)
- Resolving Braess's paradox in random networks (Q2408090) (← links)
- Inefficiency of Nash equilibria with parallel processing policy (Q2444737) (← links)
- The toll effect on price of anarchy when costs are nonlinear and asymmetric (Q2462125) (← links)
- On the severity of Braess's paradox: designing networks for selfish users is hard (Q2496322) (← links)
- Tradeoffs in worst-case equilibria (Q2503349) (← links)
- Decentralized utilitarian mechanisms for scheduling games (Q2516246) (← links)
- Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting (Q2629532) (← links)
- Modifying link capacity to avoid Braess paradox considering elastic demand (Q2675881) (← links)
- Optimal Coordination Mechanisms for Unrelated Machine Scheduling (Q3450455) (← links)
- A Selective Tour Through Congestion Games (Q3464474) (← links)
- Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games (Q3511399) (← links)
- Management of Variable Data Streams in Networks (Q3637322) (← links)
- (Q5002840) (← links)
- Risk-Averse Selfish Routing (Q5219707) (← links)
- Congestion games with priority-based scheduling (Q6049927) (← links)
