<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>2007-0705</journal-id>
<journal-title><![CDATA[Nova scientia]]></journal-title>
<abbrev-journal-title><![CDATA[Nova scientia]]></abbrev-journal-title>
<issn>2007-0705</issn>
<publisher>
<publisher-name><![CDATA[Universidad de La Salle Bajío A. C., Coordinación de Investigación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S2007-07052017000200185</article-id>
<article-id pub-id-type="doi">10.21640/ns.v9i19.1051</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Optimización de costos de transporte bajo el enfoque de teoría de juegos. Estudio de caso.]]></article-title>
<article-title xml:lang="en"><![CDATA[Transport costs optimization under game theory approach. Case study.]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Sánchez-Galván]]></surname>
<given-names><![CDATA[Fabiola]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Garay-Rondero]]></surname>
<given-names><![CDATA[Claudia L.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Mora-Castellanos]]></surname>
<given-names><![CDATA[Consuelo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Gibaja-Romero]]></surname>
<given-names><![CDATA[Damián E.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Bautista-Santos]]></surname>
<given-names><![CDATA[Horacio]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Instituto Tecnológico Superior de Tantoyuca  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Popular Autónoma del Estado de Puebla  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Universidad de Sonora  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>00</month>
<year>2017</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>00</month>
<year>2017</year>
</pub-date>
<volume>9</volume>
<numero>19</numero>
<fpage>185</fpage>
<lpage>210</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S2007-07052017000200185&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S2007-07052017000200185&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S2007-07052017000200185&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen La teoría de juegos es una herramienta matemática que permite modelar la cooperación entre agentes racionales e inteligentes. En este trabajo se presenta la teoría de juegos como una aplicación que propone escenarios de cooperación dentro de la cadena de suministro (CS) para mantener el equilibrio entre los costos logísticos de distribución que son cubiertos por los clientes de una empresa distribuidora de productos abarroteros. A partir de la aplicación del valor de Shapley y el modelo del ruteo de vehículos con capacidad (CVRP), se logró encontrar una distribución equilibrada de costos entre todos los clientes; considerando variables como la demanda, la distancia entre los nodos-clientes, la capacidad de carga y el rendimiento del vehículo. Los resultados obtenidos permitieron a la empresa lograr ahorros cercanos al 40% con relación a los costos actuales de distribución.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract Game theory is a mathematical tool that allows modeling the cooperation between rational and intelligent agents. In this paper, game theory is presented as an application that proposes cooperation scenarios within the supply chain (SC) for maintaining the balance concerning logistics costs that are paid by customers of a company that distributing grocery products. From Shapley value and Capacitated Vehicle Routing Problem (CVRP) application, the balanced costs distribution among all customers were obtained. Variables such as demand, distance between all customer nodes, load capacity and vehicle performance are considered. The results obtained allowed to achieve savings closer than 40% in relation to company current distribution costs.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[teoría de juegos]]></kwd>
<kwd lng="es"><![CDATA[valor de Shapley]]></kwd>
<kwd lng="es"><![CDATA[ruteo de vehículos]]></kwd>
<kwd lng="es"><![CDATA[juegos colaborativos]]></kwd>
<kwd lng="en"><![CDATA[game theory]]></kwd>
<kwd lng="en"><![CDATA[Shapley value]]></kwd>
<kwd lng="en"><![CDATA[vehicle routing problem]]></kwd>
<kwd lng="en"><![CDATA[cooperative games]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Non-cooperative routing in loss networks]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Altman]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Rachid El]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Abramov]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
</person-group>
<source><![CDATA[Performance Evaluation]]></source>
<year>2004</year>
<volume>49</volume>
<numero>2002</numero>
<issue>2002</issue>
<page-range>257-72</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Exact algorithms for routing problems under vehicle capacity constraints]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Baldacci]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Toth]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Vigo]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Annuals of Operations Research]]></source>
<year>2010</year>
<volume>175</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>213-45</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A game theory approach to measuring the performance reliability of transport networks]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bell]]></surname>
<given-names><![CDATA[M. G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Transportation Research Part B: Methodological]]></source>
<year>2000</year>
<volume>34</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>533-45</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bell]]></surname>
<given-names><![CDATA[M. G. H.]]></given-names>
</name>
</person-group>
<source><![CDATA[Games , Heuristics , and Risk Averseness in Vehicle Routing Problems]]></source>
<year>2004</year>
<page-range>37-41</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bertsimas]]></surname>
<given-names><![CDATA[D. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Simchi-levi]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[A New Generation of Vehicle Routing Research : Robust Algorithms , Addressing Uncertainty]]></source>
<year>1996</year>
</nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A cooperative game-theoretic approach to the social ridesharing problem]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bistaffa]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Farinelli]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Chalkiadakis]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Ramchurn]]></surname>
<given-names><![CDATA[S. D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Artificial Intelligence]]></source>
<year>2017</year>
<volume>246</volume>
<page-range>86-117</page-range><publisher-name><![CDATA[Elsevier]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Boweson]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Closs]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Cooper]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Administración y Logística en la cadena de suministros]]></source>
<year>2007</year>
<publisher-loc><![CDATA[México ]]></publisher-loc>
<publisher-name><![CDATA[Mc Graw Hill Interamericana]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chopra]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
<name>
<surname><![CDATA[Meindl]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[Administración de la cadena de suministro: Estrategia, planeación y operación]]></source>
<year>2008</year>
<publisher-loc><![CDATA[México ]]></publisher-loc>
<publisher-name><![CDATA[Pearson Educación]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[The vehicle routing problem: A taxonomic review]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Eksioglu]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Vural]]></surname>
<given-names><![CDATA[A. V.]]></given-names>
</name>
<name>
<surname><![CDATA[Reisman]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computers and Industrial Engineering]]></source>
<year>2009</year>
<volume>57</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>1472-83</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Game theory and transportation systems modelling]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fisk]]></surname>
<given-names><![CDATA[C. S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Transportation Research Part B: Methodological]]></source>
<year>1984</year>
<volume>18</volume>
<numero>4-5</numero>
<issue>4-5</issue>
<page-range>301-13</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fotakis]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Kontogiannis]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Koutsoupias]]></surname>
<given-names><![CDATA[Elias]]></given-names>
</name>
<name>
<surname><![CDATA[Mavronicolas]]></surname>
<given-names><![CDATA[Marios]]></given-names>
</name>
<name>
<surname><![CDATA[Spirakis]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[The Structure and Complexity of Nash Equilibria for a Selfish Routing Game]]></source>
<year>2002</year>
<page-range>123-34</page-range><publisher-loc><![CDATA[Berlin Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[La estructura lógica de la teoría de juegos]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[García]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Everyday Life and Games in the Civic Formation of Children. (English),]]></source>
<year>2009</year>
<volume>41</volume>
<numero>122</numero>
<issue>122</issue>
<page-range>3-27</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Fictitious play for ® nding system optimal routings in dynamic tra  c networks q.]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Garcia]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Reaume]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Smith]]></surname>
<given-names><![CDATA[R. L.]]></given-names>
</name>
</person-group>
<source><![CDATA[Transportation Research Part B]]></source>
<year>2000</year>
<volume>34</volume>
<page-range>147-56</page-range></nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[On the nucleolus of the basic vehicle]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Göthe-Lundgren]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Jörnsten]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Värbrand]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[Mathematical Programming]]></source>
<year>1996</year>
<volume>72</volume>
<page-range>83-100</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A review on cost allocation methods in collaborative transportation]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Guajardo]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Rönnqvist]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[International Transaction in Operational Research]]></source>
<year>2015</year>
<volume>23</volume>
<page-range>371-92</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Game theory applied to transportation systems in Smart Cities: analysis of evolutionary stable strategies in a generic car pooling system]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hernández]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Cárdenas]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Muñoz]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[International Journal on Interactive Design and Manufacturing (IJIDeM)]]></source>
<year>2017</year>
</nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hillier]]></surname>
<given-names><![CDATA[Frederick S.]]></given-names>
</name>
<name>
<surname><![CDATA[Lieberman]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Introducción a la Investigación de Operaciones]]></source>
<year>2010</year>
<edition>Novena</edition>
<publisher-loc><![CDATA[México ]]></publisher-loc>
<publisher-name><![CDATA[Mc Graw Hill]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[The applicability of non-cooperative game theory in transport analysis]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hollander]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Prashker]]></surname>
<given-names><![CDATA[J. N.]]></given-names>
</name>
</person-group>
<source><![CDATA[Transportation]]></source>
<year>2006</year>
<page-range>481-96</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Probability Collectives : A multi-agent approach for solving combinatorial optimization problems]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kulkarni]]></surname>
<given-names><![CDATA[A. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Tai]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<source><![CDATA[Applied Soft Computing Journal]]></source>
<year>2010</year>
<volume>10</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>759-71</page-range></nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Classical and modern heuristics for the vehicle routing problem]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Laporte]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Gendreau]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Potvin]]></surname>
<given-names><![CDATA[J.-Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Semet]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[International Transactions in Operational Research]]></source>
<year>2000</year>
<volume>7</volume>
<page-range>285-300</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Evaluating strategic issues in supply chain scheduling using game theory]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mahdavi Mazdeh]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Karamouzian]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[International Journal of Production Research]]></source>
<year>2014</year>
<volume>52</volume>
<numero>23</numero>
<issue>23</issue>
<page-range>7100-13</page-range></nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Aproximación a la teoría de juegos]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Restrepo Carvajal]]></surname>
<given-names><![CDATA[C. A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Revista Ciencias Estratégicas]]></source>
<year>2009</year>
<volume>17</volume>
<numero>22</numero>
<issue>22</issue>
<page-range>157-75</page-range></nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Mejorando la planificación de sistemas territoriales con optimización metaheurística Improving territory design planning through metaheuristic optimization]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ríos Mercado]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Nova Scientia. Revista de Investigación de La Universidad de La Salle Bajío]]></source>
<year>2015</year>
<volume>7</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>81-95</page-range></nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Una Revisión al Estado del Arte del Problema de Ruteo de Vehículos: Evolución Histórica Y Métodos De Solución]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rocha Medina]]></surname>
<given-names><![CDATA[Linda Bibiana]]></given-names>
</name>
<name>
<surname><![CDATA[González La Rota]]></surname>
<given-names><![CDATA[Elsa Cristina]]></given-names>
</name>
<name>
<surname><![CDATA[Orjuela Castro]]></surname>
<given-names><![CDATA[J. A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Ingeniería]]></source>
<year>2011</year>
<volume>16</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>35-55</page-range></nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A cooperative game approach to cost allocation in a rapid-transit network]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rosenthal]]></surname>
<given-names><![CDATA[E. C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Transportation Research Part B]]></source>
<year>2017</year>
<volume>97</volume>
<page-range>64-77</page-range></nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Multiobjective scatter search for a commercial territory design problem]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Salazar-Aguilar]]></surname>
<given-names><![CDATA[M. Angélica]]></given-names>
</name>
<name>
<surname><![CDATA[Ríos-Mercado]]></surname>
<given-names><![CDATA[Roger Z.]]></given-names>
</name>
<name>
<surname><![CDATA[González-Velarde]]></surname>
<given-names><![CDATA[José L.]]></given-names>
</name>
<name>
<surname><![CDATA[Molina]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Ann Oper Res]]></source>
<year>2012</year>
<volume>199</volume>
<page-range>343-60</page-range></nlm-citation>
</ref>
<ref id="B27">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Juegos cooperativos y sus aplicaciones económicas]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sánchez-Pérez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Perspectivas. Revista de Análisis de Economía, Comercio Y Negocios Internacionales]]></source>
<year></year>
<page-range>59-75</page-range></nlm-citation>
</ref>
<ref id="B28">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sánchez Galván]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Bautista Santos]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Mora Castellanos]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Alcaraz Zuñiga]]></surname>
<given-names><![CDATA[C. A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Rediseño de rutas en una PyME utilizando el problema de ruteo de vehículos con capacidad]]></source>
<year>2015</year>
<publisher-loc><![CDATA[Puebla, Puebla ]]></publisher-loc>
<publisher-name><![CDATA[Universidad Popular Autónoma del Estado de Puebla]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B29">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A value for n-person games]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Shapley]]></surname>
<given-names><![CDATA[L. S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Clearing House for Federal Scientific and Technical Information]]></source>
<year>1952</year>
<volume>295,</volume>
<page-range>1-13</page-range></nlm-citation>
</ref>
<ref id="B30">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Routing and scheduling hazardous material shipments : Nash game approach]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Szeto]]></surname>
<given-names><![CDATA[W. Y.]]></given-names>
</name>
</person-group>
<source><![CDATA[Transportmetrica B: Transport Dynamics]]></source>
<year>2013</year>
<volume>1</volume>
<page-range>237-60</page-range></nlm-citation>
</ref>
<ref id="B31">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yu-qin]]></surname>
<given-names><![CDATA[Feng]]></given-names>
</name>
<name>
<surname><![CDATA[Jun-qiang]]></surname>
<given-names><![CDATA[Leng]]></given-names>
</name>
<name>
<surname><![CDATA[Zhong-Yu]]></surname>
<given-names><![CDATA[Xie]]></given-names>
</name>
<name>
<surname><![CDATA[Guie]]></surname>
<given-names><![CDATA[Zhang]]></given-names>
</name>
<name>
<surname><![CDATA[Yi]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<source><![CDATA[Route choice model considering generalized travel cost based on game theory]]></source>
<year>2013</year>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
