The following pages link to (Q5501360):
Displaying 50 items.
- On the Braess paradox with nonlinear dynamics and control theory (Q255086) (← links)
- Parametric packing of selfish items and the subset sum algorithm (Q261356) (← links)
- Advances in dynamic traffic assignment: TAC. A new relationship between Wardrop's user equilibrium and Nash equilibrium (Q298924) (← links)
- Learning efficient Nash equilibria in distributed systems (Q423765) (← links)
- Repeated congestion games with bounded rationality (Q444148) (← links)
- Degrading network capacity may improve performance: private versus public monitoring in the Braess paradox (Q453657) (← links)
- Hierarchical models of warfare (Q462096) (← links)
- Stackelberg strategies and collusion in network games with splittable flow (Q538465) (← links)
- Inefficiency of logit-based stochastic user equilibrium in a traffic network under ATIS (Q542097) (← links)
- Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy (Q611044) (← links)
- On the performance of approximate equilibria in congestion games (Q634681) (← 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)
- Nash equilibria and the price of anarchy for flows over time (Q647485) (← links)
- Price of stability in survivable network design (Q647493) (← links)
- Coincident cost improvement vs. Degradation by adding connections to noncooperative networks and distributed systems (Q836011) (← links)
- Atomic routing games on maximum congestion (Q838146) (← links)
- Adaptive routing with stale information (Q838148) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Foundations of mechanism design: a tutorial. I. Key concepts and classical results (Q1001137) (← links)
- The path player game (Q1006556) (← links)
- Stackelberg strategies for selfish routing in general multicommodity networks (Q1017909) (← links)
- Efficient graph topologies in network routing games (Q1021587) (← links)
- Efficiency of atomic splittable selfish routing with polynomial cost functions (Q1024062) (← links)
- Incentive compatible and globally efficient position based routing for selfish reverse multicast in wireless sensor networks (Q1662512) (← links)
- Fair linking mechanisms for resource allocation with correlated player types (Q1698330) (← links)
- Greedy versus social: resource-competing oscillator network as a model of amoeba-based neurocomputer (Q1761689) (← links)
- A continuous theory of traffic congestion and Wardrop equilibria (Q1762538) (← links)
- Incentive-based search for equilibria in Boolean games (Q2009196) (← links)
- Bounding the inefficiency of the C-logit stochastic user equilibrium assignment (Q2014426) (← links)
- The cost of selfishness for maximizing the minimum load on uniformly related machines (Q2015810) (← links)
- Approximate Nash equilibria in anonymous games (Q2253838) (← links)
- The effect of supplier capacity on the supply chain profit (Q2259017) (← links)
- Computer science and decision theory (Q2271874) (← links)
- Collusion in atomic splittable routing games (Q2392243) (← links)
- A note on a selfish bin packing problem (Q2393075) (← links)
- Resolving Braess's paradox in random networks (Q2408090) (← links)
- Demand allocation with latency cost functions (Q2429466) (← links)
- The internet, evolutionary variational inequalities, and the time-dependent Braess paradox (Q2468772) (← links)
- A network efficiency measure with application to critical infrastructure networks (Q2481096) (← links)
- On the severity of Braess's paradox: designing networks for selfish users is hard (Q2496322) (← links)
- A Stackelberg strategy for routing flow over time (Q2516242) (← links)
- Optimal routing and charging of energy-limited vehicles in traffic networks (Q2798410) (← links)
- Complexity and Optimality of the Best Response Algorithm in Random Potential Games (Q2819446) (← links)
- COST SHARING IN NETWORKS: SOME OPEN QUESTIONS (Q2854000) (← links)
- Computer-Aided Verification for Mechanism Design (Q2959836) (← links)
- Braess's Paradox in large random graphs (Q3061184) (← links)
- Interplay between Security Providers, Consumers, and Attackers: A Weighted Congestion Game Approach (Q3098095) (← links)
- Bottleneck Congestion Games with Logarithmic Price of Anarchy (Q3162521) (← links)
- New Complexity Results and Algorithms for the Minimum Tollbooth Problem (Q3460779) (← links)
