Package: locationgamer 0.1.0

locationgamer: Identification of Location Game Equilibria in Networks

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.

Authors:Maximilian Zellner

locationgamer_0.1.0.tar.gz
locationgamer_0.1.0.zip(r-4.5)locationgamer_0.1.0.zip(r-4.4)locationgamer_0.1.0.zip(r-4.3)
locationgamer_0.1.0.tgz(r-4.4-any)locationgamer_0.1.0.tgz(r-4.3-any)
locationgamer_0.1.0.tar.gz(r-4.5-noble)locationgamer_0.1.0.tar.gz(r-4.4-noble)
locationgamer_0.1.0.tgz(r-4.4-emscripten)locationgamer_0.1.0.tgz(r-4.3-emscripten)
locationgamer.pdf |locationgamer.html✨
locationgamer/json (API)

Peer review:

Bug tracker:https://github.com/maxcal88/locationgamer/issues

On CRAN:

9 exports 0.62 score 0 dependencies 174 downloads

Last updated 4 years agofrom:e22a860729. Checks:OK: 7. Indexed: yes.

Exports:createDistancedijkstraeuclidDistancelgsolveplotDijkstraplotNetworkplotPrimprimDistancerandomCoordinates

Dependencies: