Price Dynamics on Networks
Electronic Theses and Dissertations
Item Files
Item Details
- abstract
- 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.
- subject
- Load Balancing
- Networks
- Price Dynamics
- Random Walks
- Trees
- contributor
- Berenhaut, Kenneth S. (committee chair)
- Norris, James (committee member)
- Jiang, Miaohua (committee member)
- date
- 2018-08-23T08:35:37Z (accessioned)
- 2023-09-01T08:30:06Z (available)
- 2018 (issued)
- degree
- Mathematics and Statistics (discipline)
- embargo
- 2023-09-01 (terms)
- identifier
- http://hdl.handle.net/10339/92377 (uri)
- language
- en (iso)
- publisher
- Wake Forest University
- title
- Price Dynamics on Networks
- type
- Thesis