Filters








222 Hits in 7.7 sec

Variable Demand and Multi-commodity Flow in Markovian Network Equilibrium [article]

Yue Yu, Dan Calderone, Sarah H. Q. Li, Lillian J. Ratliff, Behçet Açıkmeşe
2021 arXiv   pre-print
We propose two novel extensions of Markovian network equilibrium by considering 1) variable demand, which offers the players a quitting option, and 2) multi-commodity flow, which allows players to have  ...  Markovian network equilibrium generalizes the classical Wardrop equilibrium in network games.  ...  In Section II, we define the concept of Markovian networks, introduce Markovian network optimization, and provide generalizations that capture variable divergence and multi-commodity flow.  ... 
arXiv:1901.08731v4 fatcat:t5o2ojrsdbf5vdewaymuylfm3y

Network Congestion Control with Markovian Multipath Routing [article]

Roberto Cominetti, Cristobal Guzman
2014 arXiv   pre-print
The model combines a Network Utility Maximization for rate control based on end-to-end queuing delays, with a Markovian Traffic Equilibrium for routing based on total expected delays.  ...  In this paper we consider an integrated model for TCP/IP protocols with multipath routing.  ...  The model considers flow dependent latencies, but traffic demand and network topology are assumed to be fixed. In a similar context, the PEFT protocol in [32, Xu et al.]  ... 
arXiv:1107.2900v2 fatcat:qnsbq6mm4bg5xdabrmpp57stoa

Fast convergence to Wardrop equilibria by adaptive sampling methods

Simon Fischer, Harald Räcke, Berthold Vöcking
2006 Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC '06  
that is independent of the size and the structure of the network but only depends on a parameter of the latency functions, that we call the relative slope.  ...  In each round, each agent samples an alternative routing path and compares the latency on this path with its current latency.  ...  For example, Bertsekas and Tsitsiklis [6] describe a distributed algorithm for non-linear multi-commodity flow in which the amount of flow that is moved in one step from one path to another depends in  ... 
doi:10.1145/1132516.1132608 dblp:conf/stoc/FischerRV06 fatcat:uvswybuh5vgbnlgdxkkaytq5la

Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods

Simon Fischer, Harald Räcke, Berthold Vöcking
2010 SIAM journal on computing (Print)  
that is independent of the size and the structure of the network but only depends on a parameter of the latency functions, that we call the relative slope.  ...  In each round, each agent samples an alternative routing path and compares the latency on this path with its current latency.  ...  For example, Bertsekas and Tsitsiklis [6] describe a distributed algorithm for non-linear multi-commodity flow in which the amount of flow that is moved in one step from one path to another depends in  ... 
doi:10.1137/090746720 fatcat:675ul54chzfnnptyyyke66gc2y

Intersection Origin–Destination Flow Optimization Problem for Evacuation Network Design

Chi Xie, S. Travis Waller, Kara M. Kockelman
2011 Transportation Research Record  
Waller and K.M. Kockelman 2 network.  ...  This work presents a sufficient condition of network flows for the 24 problem existence and validness and develops an efficient simplex-based method for problem 25 solutions.  ...  Note that in a general multi-commodity network (i.e., a network with multiple10 origins and destinations), the intersection O-D flow optimization process may change the paths 11 of traffic flows going  ... 
doi:10.3141/2234-12 fatcat:k2pyu7wdnra27amif74x5ytgay

Dynamic power allocation and routing for time-varying wireless networks

M.J. Neely, E. Modiano, C.E. Rohrs
2005 IEEE Journal on Selected Areas in Communications  
Packets randomly enter the system at each node and wait in output queues to be transmitted through the network to their destinations.  ...  We then apply this control algorithm to an ad-hoc wireless network where channel variations are due to user mobility, and compare its performance with the Grossglauser-Tse relay model developed in [13]  ...  Note that (4)-(6) indicate the multi-commodity flow variables e f l g i h r £ k represent a feasible routing for commodity r .  ... 
doi:10.1109/jsac.2004.837349 fatcat:yzqhqli3nbekhesl6hkix5m3ke

Index-Volume 1B [chapter]

2013 Handbook of Computable General Equilibrium Modeling  
LEITAP, 971e972, 971t ENVISAGE land supply function, 970 LEITAP model, 970 nested CET function, 970e971 price variability across crops, 974t, 975 sensitivity analysis, 972e973, 973t demand-side assumptions  ...  , 965e967 global implications agricultural growth in baseline, 969e970 average global producer price, 967e968, 967f land supply and price growth, 969, 969t productivity growth, 968e969, 968f global stock-to-use  ...  , 1563, 1564f general equilibrium model activity levels, 1566, 1566t bilateral trade flows, 1568 calibrated substitution elasticity, 1568 energy goods, 1567, 1567t heterogeneous firms goods variables  ... 
doi:10.1016/b978-0-444-59568-3.00063-8 fatcat:m6yiq2ddhfechc3rfb6mxh5hpq

Index-Volume 1B [chapter]

2013 Handbook of Computable General Equilibrium Modeling  
LEITAP, 971e972, 971t ENVISAGE land supply function, 970 LEITAP model, 970 nested CET function, 970e971 price variability across crops, 974t, 975 sensitivity analysis, 972e973, 973t demand-side assumptions  ...  , 965e967 global implications agricultural growth in baseline, 969e970 average global producer price, 967e968, 967f land supply and price growth, 969, 969t productivity growth, 968e969, 968f global stock-to-use  ...  , 1563, 1564f general equilibrium model activity levels, 1566, 1566t bilateral trade flows, 1568 calibrated substitution elasticity, 1568 energy goods, 1567, 1567t heterogeneous firms goods variables  ... 
doi:10.1016/b978-0-444-59568-3.00064-x fatcat:fpkchhwpvvhdtk537k5b22raq4

Multi-Agent Reinforcement Learning for Dynamic Routing Games: A Unified Paradigm [article]

Zhenyu Shou, Xuan Di
2020 arXiv   pre-print
To this end, a multi-agent reinforcement learning (MARL) paradigm is proposed in which each agent learns and updates her own en-route path choice policy while interacting with others on transportation  ...  networks.  ...  Acknowledgements This work is partially sponsored by the Region 2 University Transportation Research Center (UTRC) (subcontract RUTGER PO 966112/PID#824227) and the National Science Foundation under CAREER  ... 
arXiv:2011.10915v1 fatcat:nj4dskpg4zbibc3s3rybpz24he

Toward Conceptualizing Trip-Chaining Behavior: A Review

Jean-Claude Thill, Isabelle Thomas
2010 Geographical Analysis  
“Concepts and Methods in Commodity Flow Analysis.” Economic Geography, 46, Southwort +4, (1983). “Circuit-based Indices of Locational Accessibility.”  ...  and price equilibrium (Stahl 1982; Thill 1985).  ... 
doi:10.1111/j.1538-4632.1987.tb00110.x fatcat:mw4arfeqq5gbzany5l2mhdnds4

Recent advances in robust optimization: An overview

Virginie Gabrel, Cécile Murat, Aurélie Thiele
2014 European Journal of Operational Research  
With respect to the practice of robust optimization, we consider a broad spectrum of applications, in particular inventory and logistics, finance, revenue management, but also queueing networks, machine  ...  optimization and risk theory, the concept of distributionally robust optimization, and findings in robust nonlinear optimization.  ...  Acknowledgments The authors would like to thank the Associate Editor and three anonymous referees for their insightful comments and suggestions.  ... 
doi:10.1016/j.ejor.2013.09.036 fatcat:negoppbbu5hanjkdlccdwjb35a

Network Learning via Multiagent Inverse Transportation Problems

Susan Jia Xu, Mehdi Nourinejad, Xuebo Lai, Joseph Y. J. Chow
2018 Transportation Science  
statistically inefficient (e.g. requires estimating population route and link flows).  ...  These limitations prevent modelers from fully exploiting ubiquitous data in monitoring transportation networks.  ...  Preliminary results from this work were presented at TRISTAN IX in Aruba. Helpful feedback from conference attendees and three anonymous referees is much appreciated.  ... 
doi:10.1287/trsc.2017.0805 fatcat:otq5shvyvja5xgiwdlvy7qkhty

Existence of Financial Equilibria in Continuous Time with Potentially Complete Markets

Frank Riedel, Frederik Herzberg
2012 Social Science Research Network  
We prove that in smooth Markovian continuous-time economies with potentially complete asset markets, Radner equilibria with endogenously complete markets exist.  ...  Commodities and Agents There is one physical commodity in the economy.  ...  We first recall Dana's 1993 result on existence of an Arrow-Debreu equilibrium and show that in our setup, allocation and prices are analytic functions of time and the state variable.  ... 
doi:10.2139/ssrn.2026186 fatcat:h5pj7fvkwjbb5jia3f3t4flgui

Mathematics in the Supply Chain

Robert Bixby, David Simchi-Levi, Alexander Martin, Uwe Zimmermann
2004 Oberwolfach Reports  
Especially, the multiple-depot, multiple-vehicle-type problem of bus transit can be modelled with a multi-layer multi-commodity aggregated flow network.  ...  In addition to the time-space network formulation, a minimum-cost network flow model and a Tabu Search heuristic are utilized as other modules in the planning of orders and the dispatching of trucks.  ... 
doi:10.4171/owr/2004/19 fatcat:ja4ckgdronag5m3v4tv3mq55ey

Shared mobility systems: an updated survey

Gilbert Laporte, Frédéric Meunier, Roberto Wolfler Calvo
2018 Annals of Operations Research  
According to Shaheen and Cohen [2007] the growth and expansion of car sharing systems will be fuelled by high energy costs, limited and expensive parking, improved technologies and increased demand for  ...  by 2020 and will generate in excess of US$ 6 billion in revenue.  ...  Acknowledgements This work was partially funded by the Canadian Natural Sciences and Engineering Research Council under grant 2015-06189. This support is gratefully acknowledged.  ... 
doi:10.1007/s10479-018-3076-8 fatcat:ikr73bddprgfrd323cfmtcfcve
« Previous Showing results 1 — 15 out of 222 results