¿Optimistic¿ weighted Shapley rules in minimum cost spanning tree problems

• Autores: Gustavo Bergantiños Cid, Silvia Lorenzo Freire
• Localización: Working paper series ( RGEA ), Nº. 2, 2006
• Idioma: español
• Enlaces
  • Texto completo (pdf)
• Resumen

  • We introduce optimistic weighted Shapley rules in minimum cost spanning tree problems. We define it as the weighted Shapley values of the optimistic game v+ introduced in Bergantiños and Vidal-Puga (2005b). We prove that they are obligation rules (Tijs, Branzei, Moretti, and Norde (2005)). Moreover, we present an axiomatic characterization.