Price Dynamics on Networks

In this thesis we consider price dynamics on an $n$-node graph, with particular emphasis on population distribution and movement. We propose a general model wherein at each time step population distributes to adjacent nodes with minimal price, and prices are modified to reflect local population demand. We prove some inequalities regarding local and global load balancing (in the case of trees), for a simplified model wherein prices do not decline. In regards to global load balancing, we obtain a bound in terms of the size of the edge-set of the graph; this bound is attained for star graphs. Connections to recent work on non-revisiting random walks are discussed, and some further conjectures are proposed.

Grantor dc:publisher

Wake Forest University

Year dc:date.issued

2018

Author dc:creator

• Feng, Fan

• Load Balancing

Language dc:language.iso

en

Handle dc:identifier.uri

http://hdl.handle.net/10339/92377

OAI identifier oai:identifier

oai:wakespace.lib.wfu.edu:10339/92377