Please use this identifier to cite or link to this item:
https://hdl.handle.net/10216/98231
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.creator | Alberto A. Pinto | |
dc.creator | Telmo Parreira | |
dc.date.accessioned | 2019-02-05T13:42:53Z | - |
dc.date.available | 2019-02-05T13:42:53Z | - |
dc.date.issued | 2011 | |
dc.identifier.other | sigarra:48430 | |
dc.identifier.uri | https://repositorio-aberto.up.pt/handle/10216/98231 | - |
dc.description | This paper develops a theoretical framework to study spatial price competition in a Hotelling-type network game. Each firm i is represented by a node of degree k i , where k i is the number of firm i's direct competitors (neighbors). We investigate price competition á la Hotelling with complete and incomplete information about the network structure. The goal is to investigate the effects of the network structure and of the uncertainty on firms' prices and profits. We first analyze the benchmark case where each firm knows its own degree as well as the rivals' degree. Then, in order to understand the role of information in the price competition network, we also analyze the incomplete information case where each firm knows its type (i.e. number of connections) but not the competitors' type. | |
dc.description.abstract | This paper develops a theoretical framework to study spatial price competition in a Hotelling-type network game. Each firm i is represented by a node of degree k i , where k i is the number of firm i's direct competitors (neighbors). We investigate price competition á la Hotelling with complete and incomplete information about the network structure. The goal is to investigate the effects of the network structure and of the uncertainty on firms' prices and profits. We first analyze the benchmark case where each firm knows its own degree as well as the rivals' degree. Then, in order to understand the role of information in the price competition network, we also analyze the incomplete information case where each firm knows its type (i.e. number of connections) but not the competitors' type. | |
dc.language.iso | eng | |
dc.relation.ispartof | Dynamics, Games and Science I, DYNA 2008, in Honor of Maurício Peixoto and David Rand. Springer Proceedings in Mathematics | |
dc.rights | restrictedAccess | |
dc.subject | Matemática | |
dc.subject | Mathematics | |
dc.title | A Hotelling-Type Network | |
dc.type | Capítulo ou Parte de Livro | |
dc.contributor.uporto | Faculdade de Ciências | |
dc.subject.fos | Ciências exactas e naturais::Matemática | |
dc.subject.fos | Natural sciences::Mathematics | |
Appears in Collections: | FCUP - Capítulo ou Parte de Livro |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
48430.pdf Restricted Access | 380.55 kB | Adobe PDF | Request a copy from the Author(s) |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.