Package: locationgamer
Type: Package
Title: Identification of Location Game Equilibria in Networks
Version: 0.1.0
Author: Maximilian Zellner
Maintainer: Maximilian Zellner <zellnermaximilian@gmail.com>
Description: Identification of equilibrium locations in location games (Hotelling (1929) 
    <doi:10.2307/2224214>). In these games, two competing actors place
    customer-serving units in two locations simultaneously. Customers make the 
    decision to visit the location that is closest to them. The functions in 
    this package include Prim algorithm (Prim (1957) 
    <doi:10.1002/j.1538-7305.1957.tb01515.x>) to find the minimum spanning tree 
    connecting all network vertices, an implementation of Dijkstra algorithm 
    (Dijkstra (1959) <doi:10.1007/BF01386390>) to find the shortest distance and 
    path between any two vertices, a self-developed algorithm using elimination 
    of purely dominated strategies to find the equilibrium, and several plotting 
    functions.
License: MIT + file LICENSE
Imports: graphics
Encoding: UTF-8
LazyData: true
RoxygenNote: 7.1.1
Suggests: knitr, rmarkdown
VignetteBuilder: knitr
NeedsCompilation: no
Packaged: 2020-12-16 17:16:15 UTC; maximilianzellner
Repository: CRAN
Date/Publication: 2020-12-18 09:30:02 UTC
Built: R 4.6.0; ; 2026-04-26 21:20:44 UTC; unix
