**Are you an EPFL student looking for a semester project?**

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Lecture# Financial Market Models: Arbitrage and Completeness

Description

This lecture covers the concepts of arbitrage-free and complete financial market models. Topics include computing risk-neutral probabilities, pricing structured notes, constructing equivalent probability measures, and designing risky assets to complete the market. The session also delves into hedging American options, constructing replicating strategies, and pricing European derivatives. Practical exercises involve solving problems related to market completeness, option pricing, and replicating portfolios.

Official source

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related lectures (273)

The Black-Scholes-Merton ModelFIN-404: Derivatives

Covers the Black-Scholes-Merton model, dynamics, self-financing strategies, and the PDE.

Equilibrium State Prices DeterminationFIN-609: Asset Pricing

Explains the determination of equilibrium state prices in asset pricing through consumption market clearing and budget constraints.

Asset Pricing: Theory and ApplicationsFIN-609: Asset Pricing

Series covers asset pricing theories, mean-variance optimization, state prices, and risk-neutral measures.

Portfolio Theory: Risk Parity StrategyFIN-405: Investments

Explores Portfolio Theory with a focus on the Risk Parity Strategy, discussing asset allocation proportional to the inverse of volatility and comparing different diversified portfolios.

Delta Hedging and the GreeksFIN-404: Derivatives

Explores the Black-Scholes-Merton model, the Greeks, dynamic hedging, and engineering exposure in derivative pricing.

Related concepts (292)

Dominating set

In graph theory, a dominating set for a graph G is a subset D of its vertices, such that any vertex of G is either in D, or has a neighbor in D. The domination number γ(G) is the number of vertices in a smallest dominating set for G. The dominating set problem concerns testing whether γ(G) ≤ K for a given graph G and input K; it is a classical NP-complete decision problem in computational complexity theory. Therefore it is believed that there may be no efficient algorithm that can compute γ(G) for all graphs G.

Independent set (graph theory)

In graph theory, an independent set, stable set, coclique or anticlique is a set of vertices in a graph, no two of which are adjacent. That is, it is a set of vertices such that for every two vertices in , there is no edge connecting the two. Equivalently, each edge in the graph has at most one endpoint in . A set is independent if and only if it is a clique in the graph's complement. The size of an independent set is the number of vertices it contains. Independent sets have also been called "internally stable sets", of which "stable set" is a shortening.

Computational problem

In theoretical computer science, a computational problem is a problem that may be solved by an algorithm. For example, the problem of factoring "Given a positive integer n, find a nontrivial prime factor of n." is a computational problem. A computational problem can be viewed as a set of instances or cases together with a, possibly empty, set of solutions for every instance/case. For example, in the factoring problem, the instances are the integers n, and solutions are prime numbers p that are the nontrivial prime factors of n.

Travelling salesman problem

The travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in theoretical computer science and operations research. The travelling purchaser problem and the vehicle routing problem are both generalizations of TSP.

Arbitrage

In economics and finance, arbitrage (ˈɑːrbᵻtrɑːʒ, -trɪdʒ) is the practice of taking advantage of a difference in prices in two or more markets; striking a combination of matching deals to capitalise on the difference, the profit being the difference between the market prices at which the unit is traded. When used by academics, an arbitrage is a transaction that involves no negative cash flow at any probabilistic or temporal state and a positive cash flow in at least one state; in simple terms, it is the possibility of a risk-free profit after transaction costs.