FOCS 2004 - PDF Preprint Papers

FOCS 2004 Annual IEEE Symposium on Foundations of Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed FOCS-2004 Paper

click to vote

FOCS
2004
IEEE

198views Theoretical Computer Science» more FOCS 2004»

Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games

13 years 8 months ago

Download www.cs.dartmouth.edu

We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...

Lisa Fleischer, Kamal Jain, Mohammad Mahdian

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	198	Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games	claim
2	190	Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity	claim
3	175	Edge-Disjoint Paths in Planar Graphs	claim
4	175	Dynamic Optimality -- Almost	claim
5	150	Universally Composable Protocols with Relaxed Set-Up Assumptions	claim
6	144	Approximating Edit Distance Efficiently	claim
7	137	Worst-Case to Average-Case Reductions Based on Gaussian Measures	claim
8	128	Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs	claim
9	127	Hardness of Approximating the Shortest Vector Problem in Lattices	claim
10	126	Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?	claim
11	126	Quantum Weak Coin-Flipping with Bias of 0.192	claim
12	116	An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem	claim
13	112	An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching	claim
14	112	Triangulation and Embedding Using Small Sets of Beacons	claim
15	111	Shuffling by Semi-Random Transpositions	claim
16	111	Maximum Matchings via Gaussian Elimination	claim
17	111	Stochastic Optimization is (Almost) as easy as Deterministic Optimization	claim
18	107	Measured Descent: A New Embedding Method for Finite Metrics	claim
19	105	On the (Im)possibility of Cryptography with Imperfect Randomness	claim
20	105	Testing Low-Degree Polynomials over Prime Fields	claim
21	104	Extracting Randomness Using Few Independent Sources	claim
22	103	The Price of Stability for Network Design with Fair Cost Allocation	claim
23	103	Randomly Coloring Constant Degree Graphs	claim
24	102	Dynamic Speed Scaling to Manage Energy and Temperature	claim
25	100	Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem	claim
26	96	Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation	claim
27	93	Learning with Errors in Answers to Membership Queries	claim
28	89	The Hardness of Metric Labeling	claim
29	88	On the Streaming Model Augmented with a Sorting Primitive	claim
30	88	Random Edge Can Be Exponential on Abstract Cubes	claim
31	86	Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game	claim
32	83	Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users	claim
33	83	Testing Polynomials over General Fields	claim
34	82	No Sorting? Better Searching!	claim
35	79	Optimal Power-Down Strategies	claim
36	78	Machine Minimization for Scheduling Jobs with Interval Constraints	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers