Sökning: "Concavity"

Visar resultat 6 - 10 av 13 avhandlingar innehållade ordet Concavity.

  1. 6. Optimal stopping, incomplete information, and stochastic games

    Författare :Yuqiong Wang; Erik Ekström; Sören Christensen; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Optimal stopping; sequential analysis; incomplete information; asymmetric information; stochastic filtering; Dynkin games; tug-of-war games; Mathematics; Matematik;

    Sammanfattning : This thesis contains six papers on the topics of optimal stopping and stochastic games. Paper I extends the classical Bayesian sequential testing and detection problems for a Brownian motion to higher dimensions. We demonstrate unilateral concavity of the cost function and present its structural properties through various examples. LÄS MER

  3. 7. Positive vector bundles in complex and convex geometry

    Författare :Hossein Raufi; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Nakano positivity; vanishing theorems; Prekopa theorem; Griffiths positivity; convex geometry; Ohsawa-Takegoshi extension theorem; dbar-equation; L^2-estimates; singular hermitian metrics; holomorphic vector bundles; holomorphic vector bundles; dbar-equation; L^2-estimates; singular hermitian metrics; Griffiths positivity; Nakano positivity; vanishing theorems; Ohsawa-Takegoshi extension theorem; convex geometry; Prekopa theorem;

    Sammanfattning : This thesis concerns various aspects of the geometry of holomorphic vector bundles and their analytical theory which all, vaguely speaking, are related to the notion of positive curvature in general, and L^2-methods for the dbar-equation in particular. The thesis contains four papers. LÄS MER

  4. 8. Fixed parameter algorithms and other results for convex patitions

    Författare :Magdalene Grantson Borgelt; Data Vetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : It is known that the minimum edge length convex partition MWCP of polygons with holes (an example of a PSLG) is NP-hard. Partitioning polygons with holes into the minimum number of convex polygons MNCP is also known to be NP-hard. LÄS MER

  5. 9. Risk and Rates of Time Preferences of Farm Households in Ethiopia: Implications on land investment decisions

    Författare :Mahmud Yesuf; Göteborgs universitet; []
    Nyckelord :SAMHÄLLSVETENSKAP; SOCIAL SCIENCES;

    Sammanfattning : Summary Paper 1: Risk Preferences of Farm Households in Ethiopia: Implications to Land Investment Decisions This paper measures farmers' attitude towards risk using an experimental approach for a sample of 262 farm households in Ethiopian highlands. We find more than 50 percent of the households in severe to extreme risk aversion category, unlike similar studies in Asia, where the vast majorities are found under moderate to intermediate risk aversion category. LÄS MER

  7. 10. Access selection in multi-system architectures : cooperative and competitive contexts

    Författare :Johan Hultell; Jens Andersson; Heikki Hämmäinen; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Telecommunication; Telekommunikation;

    Sammanfattning : Future wireless networks will be composed of multiple radio access technologies (RATs). To benefit from these, users must utilize the appropriate RAT, and access points (APs). In this thesis we evaluate the efficiency of selection criteria that, in addition to path-loss and system bandwidth, also consider load. LÄS MER