Connection situations under Uncertainty and Cost Monotonic Solutions
dc.contributor.author | Branzei, Rodica | |
dc.contributor.author | Gök, Zeynep Alparslan | |
dc.contributor.author | Moretti, Stefano
HAL ID: 739814 ORCID: 0000-0003-3627-3257 | |
dc.contributor.author | Tijs, Stef | |
dc.date.accessioned | 2010-09-13T08:44:32Z | |
dc.date.available | 2010-09-13T08:44:32Z | |
dc.date.issued | 2011 | |
dc.identifier.uri | https://basepub.dauphine.fr/handle/123456789/4741 | |
dc.language.iso | en | en |
dc.subject | Obligation rules | |
dc.subject | Robust spanning trees | |
dc.subject | Interval data | |
dc.subject | Cooperative cost games | |
dc.subject | Uncertainty | |
dc.subject | Minimum cost spanning tree situations | en |
dc.subject.ddc | 003 | en |
dc.title | Connection situations under Uncertainty and Cost Monotonic Solutions | en |
dc.type | Article accepté pour publication ou publié | |
dc.description.abstracten | This paper deals with cost allocation problems arising from connection situations where edge costs are closed intervals of real numbers. To solve such problems, we extend to the interval uncertainty setting the obligation rules from the theory of minimum cost spanning tree problems, and study their cost monotonicity and stability properties. We also present an application to a simulated ad-hoc wireless network using a software implementation of an appealing obligation rule, the P-value. | en |
dc.relation.isversionofjnlname | Computers and Operations Research | |
dc.relation.isversionofjnlvol | 38 | |
dc.relation.isversionofjnlissue | 11 | |
dc.relation.isversionofjnldate | 2011 | |
dc.relation.isversionofjnlpages | 1638-1645 | |
dc.relation.isversionofdoi | http://dx.doi.org/10.1016/j.cor.2011.02.004 | |
dc.description.sponsorshipprivate | oui | en |
dc.relation.isversionofjnlpublisher | Elsevier | |
dc.subject.ddclabel | Recherche opérationnelle | en |