On obligation rules for minimum cost spanning tree problems - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Gustavo Bergantiños, Anirban Kar. On obligation rules for minimum cost spanning tree problems. In Moshe Dror, Greys Sosic, editors, Proceedings of the Behavioral and Quantitative Game Theory - Conference on Future Directions, BQGT '10, Newport Beach, California, USA, May 14-16, 2010. ACM, 2010. [doi]

The following publications are possibly variants of this publication:

A generalization of obligation rules for minimum cost spanning tree problemsGustavo Bergantiños, Leticia Lorenzo, Silvia Lorenzo-Freire. eor, 211(1):122-129, 2011. [doi]

On obligation rules for minimum cost spanning tree problemsGustavo Bergantiños, Anirban Kar. geb, 69(2):224-237, 2010. [doi]

Optimistic weighted Shapley rules in minimum cost spanning tree problemsGustavo Bergantiños, Silvia Lorenzo-Freire. eor, 185(1):289-298, 2008. [doi]

A fair rule in minimum cost spanning tree problemsGustavo Bergantiños, Juan J. Vidal-Puga. jet, 137(1):326-352, 2007. [doi]

A cost allocation rule for k-hop minimum cost spanning tree problemsGustavo Bergantiños, María Gómez-Rúa, Natividad Llorca, Manuel A. Pulido, Joaquín Sánchez-Soriano. orl, 40(1):52-55, 2012. [doi]

Cost additive rules in minimum cost spanning tree problems with multiple sourcesGustavo Bergantiños, Leticia Lorenzo. anor, 301(1):5-15, 2021. [doi]

Characterization of monotonic rules in minimum cost spanning tree problemsGustavo Bergantiños, Juan J. Vidal-Puga. ijgt, 44(4):835-868, 2015. [doi]

The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple SourcesGustavo Bergantiños, Youngsub Chun, Eunju Lee, Leticia Lorenzo. igtr, 24(1), 2022. [doi]

runs on WebDSL