Pages that link to "Item:Q5712473"
From MaRDI portal
The following pages link to Integer Programming and Combinatorial Optimization (Q5712473):
Displaying 19 items.
- Stackelberg strategies and collusion in network games with splittable flow (Q538465) (← links)
- Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy (Q611044) (← links)
- The price of anarchy of serial, average and incremental cost sharing (Q934898) (← links)
- Stackelberg strategies for selfish routing in general multicommodity networks (Q1017909) (← links)
- Efficiency of atomic splittable selfish routing with polynomial cost functions (Q1024062) (← links)
- The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands. (Q1400339) (← links)
- Bounds on price of anarchy on linear cost functions (Q2351278) (← links)
- On the price of anarchy for non-atomic congestion games under asymmetric cost maps and elastic demands (Q2389520) (← links)
- The toll effect on price of anarchy when costs are nonlinear and asymmetric (Q2462125) (← links)
- Bounding the inefficiency of Nash equilibria in games with finitely many players (Q2467438) (← links)
- Price competition with elastic traffic (Q3184599) (← links)
- Stackelberg Strategies and Collusion in Network Games with Splittable Flow (Q3602835) (← links)
- Informational Braess’ Paradox: The Effect of Information on Traffic Congestion (Q4971386) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311131) (← links)
- The Price of Anarchy in Auctions (Q5346024) (← links)
- Capacity allocation to sales agents in a decentralized logistics network (Q5386385) (← links)
- The “Price of Anarchy” Under Nonlinear and Asymmetric Costs (Q5388051) (← links)
- New bounds for the price of anarchy under nonlinear and asymmetric costs (Q5413885) (← links)
- Utility Design for Distributed Resource Allocation—Part I: Characterizing and Optimizing the Exact Price of Anarchy (Q5853880) (← links)