A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Linear tolls suffice: New bounds and algorithms for tolls in single source networks
2005
Theoretical Computer Science
Preserved Fulltext
We show that tolls that are linear in the latency of the maximum latency path are necessary and sufficient to induce heterogeneous network users to independently choose routes that lead to traffic with ...
Cole et al. give an algorithm that computes optimal tolls for a bounded number of agent valuations, under the very strong assumption that they know which path each user type takes in the Nash flow imposed ...
Acknowledgments I am grateful to Kamal Jain, Mohammad Mahdian, and Tim Roughgarden for insightful discussions on this topic, and to an anonymous referee for comments that helped to improve the presentation ...
doi:10.1016/j.tcs.2005.09.014
fatcat:2vh7kkpw4zdizboghwkrar5lh4
The Minimum Tollbooth Problem in Atomic Network Congestion Games with Unsplittable Flows
2021
Theory of Computing Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
On the positive side, we present a polynomial time algorithm for networks on series-parallel graphs that turns any given state of the untolled game into a pure Nash equilibrium of the tolled game with ...
AbstractThis work analyzes the minimum tollbooth problem in atomic network congestion games with unsplittable flows. ...
A combination of graphs G 1 and G 2 in series means declaring the source of G 1 as the new global source, and the sink of G 2 as the new global sink. ...
doi:10.1007/s00224-021-10038-9
fatcat:ecf7oxws7zgctnw7viaf5qnh5u
A smoothing heuristic for a bilevel pricing problem
2006
European Journal of Operational Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
The leaderÕs dilemma is to avoid tolls too low-because they produce low revenue-, and tolls too high-because they urge the network users to choose toll-free paths. ...
It was recently shown that MAXTOLL, even in its simplest form, is strongly NP-hard [27] . 3 Besides toll optimization, variants of the basic model can be useful for pricing purposes in the airline and ...
By exploiting the network structure, the linear systems can be solved in a time linear in m for each OD pair. ...
doi:10.1016/j.ejor.2004.07.076
fatcat:e4mahbxgi5fj7hvudfvujdo45m
Real-Time Predictive Control Strategy Optimization
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The efficacy of the framework is demonstrated through a fixed demand dynamic toll optimization problem which is formulated as a non-linear program to minimize predicted network travel times. ...
In this context, this paper proposes a novel framework that integrates real-time optimization of control strategies (tolls, ramp metering rates, etc.) with guidance generation using predicted network states ...
ACKNOWLEDGMENT We would like to thank the Singapore Land Transport Authority (LTA) ITS division, for providing the data for this project. ...
arXiv:1901.04571v1
fatcat:zxpv7d57pvfrrixysdludzq7fi
Computing network tolls with support constraints
2015
Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We then present algorithms for general networks for which we systematically test the solution quality for large-scale network instances. ...
Reducing traffic congestion via toll pricing has been a central topic in the operations research and transportation literature and, recently, it has been implemented in several cities all over the world ...
We presented the first rigorous analysis for single-commodity networks with parallel links and general latency functions, and investigated heuristic algorithms for multicommodity networks. ...
doi:10.1002/net.21604
fatcat:6kysdgtejjcghhzgbwolqwgjf4
Algorithms for Flows over Time with Scheduling Costs
[chapter]
2020
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In this model, each arc has an associated delay for traversing the arc, and a bound on the rate of flow entering the arc; flows are time-varying. ...
We present a combinatorial algorithm for the natural optimization problem, that of minimizing the average total cost of all users (i.e., maximizing the social welfare). ...
Acknowledgements We thank the anonymous referees for their detailed and constructive feedback. ...
doi:10.1007/978-3-030-45771-6_11
fatcat:upmolnuwtvgxnct6qzfyim5aee
Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators
2021
Operations Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Regulating Network Pricing Games by Using Price Caps ...
Acknowledgments A preliminary version of this paper was accepted for publication in the Proceedings of the 19th ACM Conference on Economics and Computation. ...
Part of the work was done while a subset of the authors were at the Simons Institute for the Theory of Computing in Berkeley, California. ...
doi:10.1287/opre.2020.2067
fatcat:qjid7jwttjgfhk33p4ekeydkm4
Algorithms for flows over time with scheduling costs
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this model, each arc has an associated delay for traversing the arc, and a bound on the rate of flow entering the arc; flows are time-varying. ...
We present a combinatorial algorithm for the natural optimization problem, that of minimizing the average total cost of all users (i.e., maximizing the social welfare). ...
Reverse all arcs, as well as the role of the source and sink (thus making s the new sink), and also introduce a replacement sink s ′ and arc ss ′ of capacity u 0 in the original instance . ...
arXiv:1912.00082v1
fatcat:mewiiubemveq5pefcvs55v4utu
Reconciling Selfish Routing with Social Good
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Selfish routing is one of the most studied problems in algorithmic game theory, with one of the principal applications being that of routing in road networks. ...
But the emergence of routing technologies and autonomous driving motivates new solution concepts that can be considered as outcomes of the game and may help in improving the network's performance. ...
Acknowledgements This work was supported in part by NSF grants CCF 1216103 and 1331863, an NSF CAREER Award and a Google Faculty Research Award. ...
doi:10.1007/978-3-319-66700-3_12
fatcat:yha6emuqxrbpbesvaunt7zljkm
Watch and Learn: Optimizing from Revealed Preferences Feedback
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We give algorithms for efficiently solving, in terms of both computational and query complexity, a broad class of Stackelberg games in which the follower's utility function is unknown, using only "revealed ...
In this paper we present an approach to solving for the leader's optimal strategy in certain Stackelberg games where the follower's utility function (and thus the subsequent best response of the follower ...
In particular, we thank Mallesh for helpful discussions about principal-agent problems and conditions under which the profit function of the producer in the revealed preferences problem might be concave ...
arXiv:1504.01033v2
fatcat:6hn45avuvjaz7fnlxi6so3lytu
A Network Disruption Modeling Tool
2002
Military Operations Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
well established and provided known bounds for the problem of interest. ...
The network itself is notional, fabricated from information in open sources [ Alliance for Telecommunications Industry Solutions. ...
'If a piecewise linear single dimensional value function is desired then the user 'must enter, in ascending order,the score of the alternative in cells A7:A10, 'C7:C10, and so forth; followed by the corresponding ...
doi:10.5711/morj.7.1.69
fatcat:welzanovfnd6lc4azvesqtdp7y
Wealth Inequality and the Price of Anarchy
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Finally, we provide an algorithm for computing optimal tolls for any point of the trade-off of relative importance of efficiency and equality. ...
We introduce a new model that incorporates the wealth distribution of the population and captures the income elasticity of travel time. ...
Christos Papadimitriou acknowledges NSF grant 1408635 "Algorithmic Explorations of Networks, Markets, Evolution, and the Brain". Georgios Piliouras acknowledges SUTD grant ...
arXiv:1802.09269v1
fatcat:zkf3suin3fb4rczbazmojzk5uy
Altruism, selfishness, and spite in traffic routing
2008
Proceedings of the 9th ACM conference on Electronic commerce - EC '08
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We show that if the average of the coefficients for the altruistic components of all users isβ, then the price of anarchy is bounded by 1/β, for single commodity parallel link networks, and arbitrary convex ...
We show that if all users have a coefficient of at least β > 0 for the altruistic component, then the price of anarchy is bounded by 1/β, for all network topologies, arbitrary commodities, and arbitrary ...
Acknowledgments We would like to thank Tim Roughgarden and Pierre-Olivier Weill for useful discussions and references, and several anonymous referees for detailed and useful comments. ...
doi:10.1145/1386790.1386816
dblp:conf/sigecom/ChenK08
fatcat:jopk5fwqjjdntptaels3afbaam
Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In particular, the shortest path problem is NP-hard. However, there is a pseudo-polynomial time algorithm for the problem with nonnegative costs and gains. ...
However, it is solvable in polynomial time in unit-loss networks using the Edmonds-Karp algorithm. ...
Acknowledegment We like to thank Christian Bachmaier and Michael Forster for their hints which helped to simplify the proof of Theorem 9. ...
doi:10.1007/978-3-642-02270-8_4
fatcat:wgyiysltlnelbmsdigp4jv3u2q
Shortest path and maximum flow problems in networks with additive losses and gains
2011
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In particular, the shortest path problem is N P -hard. However, there is a pseudo-polynomial time algorithm for the problem with nonnegative costs and gains. ...
However, it is solvable in polynomial time in unit-loss networks using the Edmonds-Karp algorithm. ...
Acknowledgements We would like to thank an anonymous referee for her/his valuable suggestions, which led to an improvement and to Christian Bachmaier and Michael Forster for their hints on an early version ...
doi:10.1016/j.tcs.2010.11.019
fatcat:yfxbu5szl5bgjo7pwnsjiqbdwm
« Previous
Showing results 1 — 15 out of 850 results