ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Competing Research Joint Ventures (1993)
    Oxford, UK : Blackwell Publishing Ltd
    Journal of economics & management strategy 2 (1993), S. 0 
    Details
    ISSN: 1530-9134
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Economics
    Notes: Research and development (R&D) competition among firms has recently been extended to R&D competition involving research joint ventures. It was previously shown that in an industry conducting cost-reducing R&D followed by competition in the product market, if all firms both fully share R&D information and coordinate investments to maximize pint profits, final products prices are lower, and firms' profits are higher than with information shriving alone, joint profit maximization alone, or no cooperation. In this paper we question whether a single research joint venture (RJV) cartel is the best form of industry R&D coordination. We show that there are circumstances in which splitting a single RJV cartel into several competing ones yields lower product prices. Moreover, we show that in these circumstances, splitting the industry into exactly two competing RJV cartels would be best.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1430-9134.1993.00023.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    A smoothing-out technique for min—max optimization (1980)
    Springer
    Mathematical programming 19 (1980), S. 61-77 
    Details
    ISSN: 1436-4646
    Keywords: Optimization ; Nonlinear Programming ; Unconstrained Optimization ; Nondifferentiable Optimization ; Min—Max Problems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper, we suggest approximations for smoothing out the kinks caused by the presence of “max” or “min” operators in many non-smooth optimization problems. We concentrate on the continuous-discrete min—max optimization problem. The new approximations replace the original problem in some neighborhoods of the kink points. These neighborhoods can be made arbitrarily small, thus leaving the original objective function unchanged at almost every point ofR n . Furthermore, the maximal possible difference between the optimal values of the approximate problem and the original one, is determined a priori by fixing the value of a single parameter. The approximations introduced preserve properties such as convexity and continuous differentiability provided that each function composing the original problem has the same properties. This enables the use of efficient gradient techniques in the solution process. Some numerical examples are presented.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01581628
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    A new arc algorithm for unconstrained optimization (1978)
    Springer
    Mathematical programming 15 (1978), S. 36-52 
    Details
    ISSN: 1436-4646
    Keywords: Optimization ; Non-linear Programming ; Unconstrained Optimization ; Gradientpath Algorithms ; Quasi-Newton Methods ; Arc Algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The gradient path of a real valued differentiable function is given by the solution of a system of differential equations. For a quadratic function the above equations are linear, resulting in a closed form solution. A quasi-Newton type algorithm for minimizing ann-dimensional differentiable function is presented. Each stage of the algorithm consists of a search along an arc corresponding to some local quadratic approximation of the function being minimized. The algorithm uses a matrix approximating the Hessian in order to represent the arc. This matrix is updated each stage and is stored in its Cholesky product form. This simplifies the representation of the arc and the updating process. Quadratic termination properties of the algorithm are discussed as well as its global convergence for a general continuously differentiable function. Numerical experiments indicating the efficiency of the algorithm are presented.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01608998
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    On the convexifiability of pseudoconvex C2-functions (1980)
    Springer
    Mathematical programming 19 (1980), S. 289-299 
    Details
    ISSN: 1436-4646
    Keywords: Generalized Convexity ; Pseudoconvexity ; Strict Pseudoconvexity ; Convexifiability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We present new criteria that characterize functions which are convex transformable by a suitable strictly increasing function. We concentrate on twice continuously differentiable pseudoconvex and strictly pseudoconvex functions, and derive conditions which are both necessary and sufficient for these functions to be convex transformable.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01581649
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    “Costless” regulation of monopolies with large entry cost: A game theoretic approach (1999)
    Springer
    International journal of game theory 28 (1999), S. 35-52 
    Details
    ISSN: 1432-1270
    Keywords: Key words: Antitrust regulation ; monopolies ; Nash equilibria
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract. A major issue within the realm of Antitrust policy is the regulation of existing monopolies. We describe a new potential indirect scheme for regulating a natural monopoly that arises from high entry cost. The approach involves minimal government intervention, and it is based on encouraging entry by offering to subsidize entry cost for potential competitors. We pose this issue as a four-stage non-cooperative game. Analysis of sub-game perfect Nash equilibria of the game reveals that the first best outcome is achieved as the unique equilibrium in which the monopolist prices at marginal cost and there is no entry. The regulation is “costless,” since no entry will occur and hence no subsidy will be paid.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s001820050097
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...