Narrow search
Showing 1 - 10 of 115
Cover Image
Some remarks on lower hemicontinuity of convex multivalued mappings
Piotr, Maćkowiak - Volkswirtschaftliche Fakultät, … - 2004
For a multifunction a condition sufficient for lower hemicontinuity is presented. It is shown that under convexity of …
Persistent link: https://www.econbiz.de/10011257819
Cover Image
On the Extreme Points of Two Polytopes associated with a Digraph and Applications to Cooperative Games
Brink, René van den; Laan, Gerard van der; Vasil'ev, Valeri - Tinbergen Instituut - 2004
extreme points of two closely related polytopes that are assigned to a digraph. The first polytope is the set of all sharing …
Persistent link: https://www.econbiz.de/10011256717
Cover Image
Implementing the Nelder-Mead simplex algorithm with adaptive parameters
Gao, Fuchang; Han, Lixing - In: Computational Optimization and Applications 51 (2012) 1, pp. 259-277
Persistent link: https://www.econbiz.de/10010998388
Cover Image
Solution Concepts for Games with General Coalitional Structure (Replaces CentER DP 2011-025)
Talman, Dolf; Koshevoy, G.A. - Tilburg University, Center for Economic Research - 2011
condition than convexity of the game. For an arbitrary set system we show that there exists a unique minimal building set …
Persistent link: https://www.econbiz.de/10011092044
Cover Image
On the Extreme Points of Two Polytopes associated with a Digraph and Applications to Cooperative Games
Brink, René van den; Laan, Gerard van der; Vasil'ev, Valeri - Tinbergen Institute - 2004
polytope is the set of all sharing vectors (elements from the unit simplex) such that each node gets at least as much as each …
Persistent link: https://www.econbiz.de/10005136905
Cover Image
Indivisibility and divisibility polytopes.
COPPERSMITH, Don; LEE, Jon - Center for Operations Research and Econometrics (CORE), … - 2000
We study thep olytopes of binary n-strings that encode (positive) integers that are not divisible by a particular positive integer p - the indivisibility polytopes, as well as the more general "clipped cubes". Also, we discuss a potential application to factoring. Finally, we present some...
Persistent link: https://www.econbiz.de/10005043070
Cover Image
The price of fairness with the extended Perles–Maschler solution
Zhong, Feimin; Xie, Jinxing; Zhao, Xiaobo - In: Mathematical Methods of Operations Research 80 (2014) 2, pp. 193-212
In Nash bargaining problem, due to fairness concerns of players, instead of maximizing the sum of utilities of all players, an implementable solution should satisfy some axioms or characterizations. Such a solution can result in the so-called price of fairness, because of the reduction in the...
Persistent link: https://www.econbiz.de/10011152062
Cover Image
SOME NONSTANDARD FEATURES OF BARGAINING PROBLEMS
AGNETIS, ALESSANDRO; FRAGNELLI, VITO - In: International Game Theory Review (IGTR) 15 (2013) 02, pp. 1340007-1
In this paper, we present two real-world situations in which the standard hypotheses of a bargaining problem do not hold, and discuss how to tackle these situations.
Persistent link: https://www.econbiz.de/10011011346
Cover Image
The Average Tree Solution for Cooperative Games with Communication Structure
Herings, P. Jean-Jacques; Laan, Gerard van der; Talman, Dolf - Tinbergen Instituut - 2008
-free communication structure, it is the solution proposed by Herings, van der Laan and Talman (2008). We introduce the notion of link-convexity …, under which the game is shown to have a non-empty core and the average tree solution lies in the core. In general, link-convexity … is weaker than convexity. For games with a cycle-free communication structure, link-convexity is even weaker than super-additivity. …
Persistent link: https://www.econbiz.de/10011255465
Cover Image
Stochastic Dominance: Convexity and Some Efficiency Tests
Lizyayev, Andrey M. - Tinbergen Instituut - 2009
convexity and efficient set characterization results on SD efficiency of a given portfolio relative to adiversified set of …
Persistent link: https://www.econbiz.de/10011256268