### Refine

#### Year of publication

- 2009 (35) (remove)

#### Document Type

- Report (35) (remove)

#### Keywords

- algorithmic game theory (2)
- option pricing (2)
- American options (1)
- Analysis (1)
- Ausfallwahrscheinlichkeit (1)
- Automatic Differentiation (1)
- Black–Scholes approach (1)
- Capacitated Hub Location (1)
- Capacity decisions (1)
- Constrained mechanical systems (1)
- Constraint Programming (1)
- Cosserat rod (1)
- Customer distribution (1)
- Datenerfassung und -auswertung (1)
- Decision support systems (1)
- Design (1)
- Didaktik (1)
- Elliptic boundary value problems (1)
- FEM (1)
- Festigkeitsverteilung (1)
- Finite rotations (1)
- Flexible multibody dynamics (1)
- G2++ model (1)
- Galerkin Approximation (1)
- Geometric (1)
- Geothermal Flow (1)
- Geothermischer Fluss (1)
- Graphentheorie (1)
- HJM (1)
- Heston model (1)
- Heuristic (1)
- Heuristics (1)
- Home Health Care (1)
- Hub Location (1)
- Hull White model (1)
- IMRT planning (1)
- Iterative learning control (1)
- Jiang’s Model of Elastoplasticity (1)
- Kirchhoff and Cosserat rods (1)
- Kommunikationsprotokoll (1)
- Konfidenz (1)
- Kristallmathematik (1)
- Kundenbeanspruchung (1)
- Lagrangian mechanics (1)
- Large deformations (1)
- Lebensdauerberechnung (1)
- Lehrmittel (1)
- Linear Programming (1)
- MILP formulations (1)
- MIP formulations (1)
- Metaheuristics (1)
- Monte-Carlo methods (1)
- Multibody simulation (1)
- Nash equilibria (1)
- Noether’s theorem (1)
- Nutzungsprofil (1)
- Order of printed copy (1)
- Parameter Identification (1)
- Parsimonious Heston Model (1)
- Parteto surface (1)
- Peer-to-Peer-Netz (1)
- Pleated Filter (1)
- Quanto option (1)
- Rotational spinning process (1)
- Rounding (1)
- Route Planning (1)
- Solid-Gas Separation (1)
- Solid-Liquid Separation (1)
- Special Cosserat rods (1)
- Stress-strain correction (1)
- Supply Chain Design (1)
- Theorie schwacher Lösungen (1)
- Titration (1)
- Trennverfahren (1)
- Weak Solution Theory (1)
- aerodynamic drag (1)
- artial differential algebraic equations (1)
- asymptotic Cosserat models (1)
- bin coloring (1)
- calibration (1)
- correlation (1)
- curved viscous fibers (1)
- deformable bodies (1)
- differential algebraic equations (1)
- discrete mechanics (1)
- discrete time setting (1)
- dividend discount model (1)
- dividends (1)
- drift due to noise (1)
- dynamic network flows (1)
- earliest arrival flows (1)
- edge detection (1)
- energy conservation (1)
- fiber-fluid interaction (1)
- fiber-fluid interactions (1)
- finite differences (1)
- flexible bodies (1)
- force-based simulation (1)
- full vehicle model (1)
- geometrically exact rods (1)
- hyperealstic (1)
- image processing (1)
- improving and feasible directions (1)
- inhomogeneous Helmholtz type differential equations in bounded domains (1)
- long slender fibers (1)
- maximal function (1)
- mechanism design (1)
- model reduction (1)
- modified gradient projection method (1)
- multi-asset (1)
- multibody dynamics (1)
- nonlinear diffusion (1)
- nonlinear model reduction (1)
- numerical methods (1)
- optimal control theory (1)
- path-connected sublevelsets (1)
- polynomial algorithms (1)
- price of anarchy (1)
- price of stability (1)
- quantile estimation (1)
- radiotherapy planning (1)
- safety critical components (1)
- selfish routing (1)
- series-parallel graphs (1)
- sharp function (1)
- sicherheitsrelevante Bauteile (1)
- slender-body theory (1)
- strong equilibria (1)
- turbulence modeling (1)
- turbulence modelling (1)
- wave based method (1)
- weakly/ strictly pareto optima (1)

#### Faculty / Organisational entity

We prove a general monotonicity result about Nash flows in directed networks and use it for the design of truthful mechanisms in the setting where each edge of the network is controlled by a different selfish agent, who incurs costs when her edge is used. The costs for each edge are assumed to be linear in the load on the edge. To compensate for these costs, the agents impose tolls for the usage of edges. When nonatomic selfish network users choose their paths through the network independently and each user tries to minimize a weighted sum of her latency and the toll she has to pay to the edges, a Nash flow is obtained. Our monotonicity result implies that the load on an edge in this setting can not increase when the toll on the edge is increased, so the assignment of load to the edges by a Nash flow yields a monotone algorithm. By a well-known result, the monotonicity of the algorithm then allows us to design truthful mechanisms based on the load assignment by Nash flows. Moreover, we consider a mechanism design setting with two-parameter agents, which is a generalization of the case of one-parameter agents considered in a seminal paper of Archer and Tardos. While the private data of an agent in the one-parameter case consists of a single nonnegative real number specifying the agent's cost per unit of load assigned to her, the private data of a two-parameter agent consists of a pair of nonnegative real numbers, where the first one specifies the cost of the agent per unit load as in the one-parameter case, and the second one specifies a fixed cost, which the agent incurs independently of the load assignment. We give a complete characterization of the set of output functions that can be turned into truthful mechanisms for two-parameter agents. Namely, we prove that an output function for the two-parameter setting can be turned into a truthful mechanism if and only if the load assigned to every agent is nonincreasing in the agent's bid for her per unit cost and, for almost all fixed bids for the agent's per unit cost, the load assigned to her is independent of the agent's bid for her fixed cost. When the load assigned to an agent is continuous in the agent's bid for her per unit cost, it must be completely independent of the agent's bid for her fixed cost. These results motivate our choice of linear cost functions without fixed costs for the edges in the selfish routing setting, but the results also seem to be interesting in the context of algorithmic mechanism design themselves.

Gegenstand dieser Arbeit ist die Entwicklung eines Wärmetransportmodells für tiefe geothermische (hydrothermale) Reservoire. Existenz- und Eindeutigkeitsaussagen bezüglich einer schwachen Lösung des vorgestellten Modells werden getätigt. Weiterhin wird ein Verfahren zur Approximation dieser Lösung basierend auf einem linearen Galerkin-Schema dargelegt, wobei sowohl die Konvergenz nachgewiesen als auch eine Konvergenzrate erarbeitet werden.

The capacitated single-allocation hub location problem revisited: A note on a classical formulation
(2009)

Denote by G = (N;A) a complete graph where N is the set of nodes and A is the set of edges. Assume that a °ow wij should be sent from each node i to each node j (i; j 2 N). One possibility is to send these °ows directly between the corresponding pairs of nodes. However, in practice this is often neither e±cient nor costly attractive because it would imply that a link was built between each pair of nodes. An alternative is to select some nodes to become hubs and use them as consolidation and redistribution points that altogether process more e±ciently the flow in the network. Accordingly, hubs are nodes in the graph that receive tra±c (mail, phone calls, passengers, etc) from di®erent origins (nodes) and redirect this tra±c directly to the destination nodes (when a link exists) or else to other hubs. The concentration of tra±c in the hubs and its shipment to other hubs lead to a natural decrease in the overall cost due to economies of scale.

Radiotherapy is one of the major forms in cancer treatment. The patient is irradiated with high-energetic photons or charged particles with the primary goal of delivering sufficiently high doses to the tumor tissue while simultaneously sparing the surrounding healthy tissue. The inverse search for the treatment plan giving the desired dose distribution is done by means of numerical optimization [11, Chapters 3-5]. For this purpose, the aspects of dose quality in the tissue are modeled as criterion functions, whose mathematical properties also affect the type of the corresponding optimization problem. Clinical practice makes frequent use of criteria that incorporate volumetric and spatial information about the shape of the dose distribution. The resulting optimization problems are of global type by empirical knowledge and typically computed with generic global solver concepts, see for example [16]. The development of good global solvers to compute radiotherapy optimization problems is an important topic of research in this application, however, the structural properties of the underlying criterion functions are typically not taken into account in this context.

One approach to multi-criteria IMRT planning is to automatically calculate a data set of Pareto-optimal plans for a given planning problem in a first phase, and then interactively explore the solution space and decide for the clinically best treatment plan in a second phase. The challenge of computing the plan data set is to assure that all clinically meaningful plans are covered and that as many as possible clinically irrelevant plans are excluded to keep computation times within reasonable limits. In this work, we focus on the approximation of the clinically relevant part of the Pareto surface, the process that consititutes the first phase. It is possible that two plans on the Parteto surface have a very small, clinically insignificant difference in one criterion and a significant difference in one other criterion. For such cases, only the plan that is clinically clearly superior should be included into the data set. To achieve this during the Pareto surface approximation, we propose to introduce bounds that restrict the relative quality between plans, so called tradeoff bounds. We show how to integrate these trade-off bounds into the approximation scheme and study their effects.

Home Health Care (HHC) services are becoming increasingly important in Europe’s aging societies. Elderly people have varying degrees of need for assistance and medical treatment. It is advantageous to allow them to live in their own homes as long as possible, since a long-term stay in a nursing home can be much more costly for the social insurance system than a treatment at home providing assistance to the required level. Therefore, HHC services are a cost-effective and flexible instrument in the social system. In Germany, organizations providing HHC services are generally either larger charities with countrywide operations or small private companies offering services only in a city or a rural area. While the former have a hierarchical organizational structure and a large number of employees, the latter typically only have some ten to twenty nurses under contract. The relationship to the patients (“customers”) is often long-term and can last for several years. Therefore acquiring and keeping satisfied customers is crucial for HHC service providers and intensive competition among them is observed.

In this work we use the Parsimonious Multi–Asset Heston model recently developed in [Dimitroff et al., 2009] at Fraunhofer ITWM, Department Financial Mathematics, Kaiserslautern (Germany) and apply it to Quanto options. We give a summary of the model and its calibration scheme. A suitable transformation of the Quanto option payoff is explained and used to price Quantos within the new framework. Simulated prices are given and compared to market prices and Black–Scholes prices. We find that the new approach underprices the chosen options, but gives better results than the Black–Scholes approach, which is prevailing in the literature on Quanto options.

Four aspects are important in the design of hydraulic lters. We distinguish between two cost factors and two performance factors. Regarding performance, filter eciencynd lter capacity are of interest. Regarding cost, there are production considerations such as spatial restrictions, material cost and the cost of manufacturing the lter. The second type of cost is the operation cost, namely the pressure drop. Albeit simulations should and will ultimately deal with all 4 aspects, for the moment our work is focused on cost. The PleatGeo Module generates three-dimensional computer models of a single pleat of a hydraulic lter interactively. PleatDict computes the pressure drop that will result for the particular design by direct numerical simulation. The evaluation of a new pleat design takes only a few hours on a standard PC compared to days or weeks used for manufacturing and testing a new prototype of a hydraulic lter. The design parameters are the shape of the pleat, the permeabilities of one or several layers of lter media and the geometry of a supporting netting structure that is used to keep the out ow area open. Besides the underlying structure generation and CFD technology, we present some trends regarding the dependence of pressure drop on design parameters that can serve as guide lines for the design of hydraulic lters. Compared to earlier two-dimensional models, the three-dimensional models can include a support structure.