Please use this identifier to cite or link to this item:
http://hdl.handle.net/2445/176011
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Jarque i Ribera, Xavier | - |
dc.contributor.advisor | Martínez de Albéniz, F. Javier | - |
dc.contributor.author | Camacho Martı́n, Laura | - |
dc.date.accessioned | 2021-04-09T09:28:52Z | - |
dc.date.available | 2021-04-09T09:28:52Z | - |
dc.date.issued | 2020-06 | - |
dc.identifier.uri | http://hdl.handle.net/2445/176011 | - |
dc.description | Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2020, Director: Xavier Jarque i Ribera i F. Javier Martínez de Albéniz | ca |
dc.description.abstract | [en] In this project we study minimun cost spanning tree problems and how to associate them with a cooperative game of transferable utility. Some real economic situations such as the construction of an electricity network for the supply of energy to an entire village from a common power station can be modelled by these problems. This case was studied by Dutta and Kar (2004). On the one hand, we define two algorithms capable of obtaining a minimum cost spanning tree of a connected graph, namely Prim’s (1957) and Kruskal’s (1956). On the other hand, we explain a series of cost allocation rules, which are interpreted under the prism of cooperative games. A series of properties are detailed to see which of these properties determine them. We also study the irreducible form introduced by Bird (1976) associated with a minimum cost spanning tree problem. We see how to associate one to each problem and analyze the equivalence between rules in this irreducible form. | ca |
dc.format.extent | 55 p. | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | cat | ca |
dc.rights | cc-by-nc-nd (c) Laura Camacho Martı́n, 2020 | - |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ | * |
dc.source | Treballs Finals de Grau (TFG) - Matemàtiques | - |
dc.subject.classification | Arbres (Teoria de grafs) | ca |
dc.subject.classification | Treballs de fi de grau | - |
dc.subject.classification | Jocs cooperatius (Matemàtica) | ca |
dc.subject.classification | Xarxes elèctriques | ca |
dc.subject.other | Trees (Graph theory) | en |
dc.subject.other | Bachelor's theses | - |
dc.subject.other | Cooperative games (Mathematics) | en |
dc.subject.other | Electric networks | en |
dc.title | Arbres de cost mı́nim i jocs cooperatius | ca |
dc.type | info:eu-repo/semantics/bachelorThesis | ca |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | ca |
Appears in Collections: | Treballs Finals de Grau (TFG) - Matemàtiques |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
176011.pdf | Memòria | 460.7 kB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License