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

13 years 4 months ago

Download www.seio2006.ull.es

We introduce optimistic weighted Shapley rules in minimum cost spanning tree problems. We dene them as the weighted Shapley values of the optimistic game v+ introduced in Berganti

Gustavo Bergantiños, Silvia Lorenzo-Freire

Real-time Traffic

EOR 2008 | Optimistic Game V+ | Shapley Rules | Weighted Shapley Values |

claim paper

» A Weighted Coding in a Genetic Algorithm for the DegreeConstrained Minimum Spanning Tree P...

» A linear programming approach to increasing the weight of all minimum spanning trees

» Approximating Spanning Trees with Inner Nodes Cost

» A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees

» An antbased algorithm for finding degreeconstrained minimum spanning tree

» Modeling and solving the rooted distanceconstrained minimum spanning tree problem

» Approximating minimum bounded degree spanning trees to within one of optimal

» AverageCase Analyses of Vickrey Costs

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	EOR
Authors	Gustavo Bergantiños, Silvia Lorenzo-Freire

Comments (0)

Sciweavers

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

EOR 2008 | Optimistic Game V+ | Shapley Rules | Weighted Shapley Values |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers