Selfish Routing with Non-Increasing Latency Functions

@inproceedings{Lau2007SelfishRW,
  title={Selfish Routing with Non-Increasing Latency Functions},
  author={Enoch Chee-Lok Lau},
  year={2007}
}
Selfish routing is an area of study that lies at the intersection of theoretical computer science and the economic notions of game theory. It models the behaviour of self-interested, or selfish, users through a network that suffers from the effects of congestion. Typically, the congestion on a link in a network is assumed to be a non-decreasing function of the amount of traffic being sent through that link. We provide a theoretical characterisation of the nature of networks with selfish users… CONTINUE READING

Citations

Publications citing this paper.

MIN-COST MULTICAST ROUTING USING AN EFFICIENT EDGE TAX SCHEME

VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-10 OF 36 REFERENCES

The Economics of Welfare

VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

Selfish routing and the price of anarchy

VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

How bad is selfish routing?In JACM

VIEW 12 EXCERPTS
HIGHLY INFLUENTIAL

Equilibrium on a congested transport network

H. Aashtiani, T. Magnanti
  • SIAM Journal of Algebraic and Discrete Methods, 2:213–216
  • 1983
VIEW 11 EXCERPTS
HIGHLY INFLUENTIAL

Studies in the economics of transportation

M. Beckmann
  • New Haven: Pub. for the Cowles Commission for Research in Economics by Yale Univ. Press
  • 1956
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Min-Cost Multicast of Selfish Information Flows

  • IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications
  • 2007
VIEW 2 EXCERPTS