A Competitive Strategy for Routing Flow over Time UMANG BHASKAR Dartmouth College and LISA FLEISCHER Dartmouth College and ELLIOT ANSHELEVICH Rensselaer Polytechnic Institute Network routing games are used to understand the impact of individual users decisions on network e ciency. Prior work on routing games uses a simpli ed model of network ow where all ow exists simultaneously. In our work, we examine routing games in a ow-over-time model. We show that by reducing network capacity judiciously, the network owner can ensure that the equilibrium is no worse than a small constant times the optimal in the original network, for two natural measures of optimality. These are the rst upper bounds on the price of anarchy in the ow-over-time model for general networks. Categories and Subject Descriptors: J.4 [Social and Behavioral Sciences]: Economics General Terms: Algorithms, Economics, Theory Additional Key Words and Phrases: routing games, price of anarchy, ow-over-time 1. INTRODUCTION We are interested in understanding the behavior of tra c in large networks, such as the Internet and road networks. There are two common features of tra c in these networks. (1) Tra c travels over time. Thus, the state of these networks is a function
End of preview. The entire article is 6 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/a-competitive-strategy-for-routing-flow-over-time-Nm0OtvEvyt
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
A competitive strategy for routing flow over time
Bhaskar, Umang; Fleischer, Lisa; Anshelevich, Elliot
Follow ACM SIGecom Exchanges
, Volume 10 (2)
Association for Computing Machinery – Jun 1, 2011
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
