Narrow search
Showing 1 - 10 of 17
Cover Image
Obligation Rules for Minimum Cost Spanning Tree Situations and their Monotonicity Properties
Norde, Henk; Tijs, S.H.; Brânzei, R.; Moretti, S. - Tilburg University, Center for Economic Research - 2004
algorithm.It turns out that the Potters value (P-value) is an element of this class. …
Persistent link: https://www.econbiz.de/10011090299
Cover Image
Contiuum of Zero Points of a Mapping on a Compact Convex Set
Talman, Dolf; Yamamoto, M. - Tilburg University, Center for Economic Research - 2001
Persistent link: https://www.econbiz.de/10011090352
Cover Image
A Discrete Multivariate Mean Value Theorem with Applications
Talman, Dolf; Yang, Z.F. - Tilburg University, Center for Economic Research - 2006
AMS classifications: 47H10; 54H25; 55M20; 90C33; 91B50
Persistent link: https://www.econbiz.de/10011090682
Cover Image
Strongly Essential Coalitions and the Nucleolus of Peer Group Games
Brânzei, R.; Solymosi, T.; Tijs, S.H. - Tilburg University, Center for Economic Research - 2003
-1. We propose an algorithm that computes the nucleolus of an n-player peer group game in O(n2) time directly from the …
Persistent link: https://www.econbiz.de/10011090844
Cover Image
A Comparison of Algorithms for the Multivariate L1-Median
Fritz, H.; Filzmoser, P.; Croux, C. - Tilburg University, Center for Economic Research - 2010
algorithms have been implemented in a standardized manner in the open source environment R. In most sit- uations, the algorithm …
Persistent link: https://www.econbiz.de/10011091113
Cover Image
On the Connectedness of Coincidences and Zero Points of Mappings
Talman, Dolf; Yang, Z.F. - Tilburg University, Center for Economic Research - 2003
Persistent link: https://www.econbiz.de/10011091292
Cover Image
A Vertex Oriented Approach to Minimum Cost Spanning Tree Problems
Ciftci, B.B.; Tijs, S.H. - Tilburg University, Center for Economic Research - 2007
In this paper we consider spanning tree problems, where n players want to be connected to a source as cheap as possible. We introduce and analyze (n!) vertex oriented construct and charge procedures for such spanning tree situations leading in n steps to a minimum cost spanning tree and a cost...
Persistent link: https://www.econbiz.de/10011091850
Cover Image
General equilibrium programming
Talman, Dolf - Tilburg University, Center for Economic Research - 1990
Persistent link: https://www.econbiz.de/10011092027
Cover Image
Computing Integral Solutions of Complementarity Problems
Talman, Dolf; van der Laan, G.; Yang, Z.F. - Tilburg University, Center for Economic Research - 2005
AMS classifications: 90C33, 90C26, 91B50.
Persistent link: https://www.econbiz.de/10011092187
Cover Image
Convex Congestion Network Problems
Quant, Marieke; Reijnierse, Hans - Tilburg University, Center for Economic Research - 2004
costs, an algorithm based on a shortest path algorithm, can be used to find an optimal network for any coalition …
Persistent link: https://www.econbiz.de/10011092611