We describe competition over space between a competitive shipping industry (truck-barge) and one with market power (the railroad). The latter prices so as to "beat the competition" in equilibrium, or else at the monopoly price, if that is lower. The monopoly price rises more slowly than do the costs of transportation (freight absorption) if the spatial demand at each point is log-concave. With ...

We investigated the relationship between railroad station and areal population density in Japan. A cross-sectional analysis and a series of longitudinal analysis on the station development and changes in population density are conducted. The overall trend of higher density near the station is observed with a relatively high level of variance. Also, it is pointed out that railroad service is nec...

(Open) Standards Wars In “The Art of Standards Wars,” Robert Shapiro gives a brief overview of several major standards wars in business history. The oldest one he mentions is the battle over standard railroad gauge between the Northern and Southern United States. The development of railroads in the United States was done with little coordination, so that by 1860, there were seven different rail...

In this paper we consider a bistable reaction-diffusion equation in unbounded domains and we investigate the existence of propagation phenomena, possibly partial, in some direction or, on the contrary, of blocking phenomena. We start by proving the well-posedness of the problem. Then we prove that when the domain has a decreasing cross section with respect to the direction of propagation there ...

We consider the problem of stable matching with dynamic preference lists. At each time step, the preference list of some player may change by swapping random adjacent members. The goal of a central agency (algorithm) is to maintain an approximately stable matching (in terms of number of blocking pairs) at all times. The changes in the preference lists are not reported to the algorithm, but must...

In max-plus algebra, some algorithms for determining the eigenvector of irreducible matrices are power algorithm and Kleene star algorithm. this research, a modified will be discussed to compensate disadvantages The algorithm’s time complexity is O(n(n!)), new O(n4), while cannot calculated. This research also applies algebra in railroad network scheduling problem, constructing graphical user i...