Algorithmic Derivative Trading. Types for CNFs Type of a clause: –Pair: (length, positive literals) –Example: (2,2) for (a or b) Type of a cnf: –Set union.

Slides:



Advertisements
Similar presentations
9 x9 81 4/12/2015 Know Your Facts!. 9 x2 18 4/12/2015 Know Your Facts!
Advertisements

1 x0 0 4/15/2015 Know Your Facts!. 9 x1 9 4/15/2015 Know Your Facts!
1 x0 0 4/16/2015 Know Your Facts!. 1 x8 8 4/16/2015 Know Your Facts!
Cook’s Theorem The Foundation of NP-Completeness.
3 x0 0 7/18/2015 Know Your Facts!. 4 x3 12 7/18/2015 Know Your Facts!
Properties of SLUR Formulae Ondřej Čepek, Petr Kučera, Václav Vlček Charles University in Prague SOFSEM 2012 January 23, 2012.

Complexity 25-1 Complexity Andrei Bulatov #P-Completeness.
The Welfare Analysis of Free Trade The fact that a nation unequivocally gains from international trade does not mean that all groups within the nation.
NP-Complete Problems Reading Material: Chapter 10 Sections 1, 2, 3, and 4 only.
1 Polynomial Time Reductions Polynomial Computable function : For any computes in polynomial time.
Restricted Satisfiability (SAT) Problem
Complexity 19-1 Complexity Andrei Bulatov More Probabilistic Algorithms.
Chapter Eleven Asset Markets. Assets u An asset is a commodity that provides a flow of services over time. u E.g. a house, or a computer. u A financial.
Randomzied Unique k-SAT R. Paturi, P. Pudlak, M.E. Saks and F. Zane An Improved Exponential-time Algorithm for k-SAT Journal of the ACM, Vol 52, No. 3,
1 The PCP starting point. 2 Overview In this lecture we’ll present the Quadratic Solvability problem. In this lecture we’ll present the Quadratic Solvability.
Restricted Satisfiability (SAT) Problem
ADVERTISE THIS! Our Product Name: Price: Where to buy it: How to use it and good points:
My game… You pay £1 to play I roll a dice If it lands on 1 or 2 you win £1.50 If it lands on 3, 4, 5, 6 you lose Will this game make me a profit if 10.
Factoring Polynomials Factoring by Decomposition.
Steve Paulone Facilitator Features of Stock (Equity)  Like bonds, stocks are securities that corporations issue to raise capital to invest in the firm.
SDG Mittagsseminar1 Using Artificial Markets to Teach Computer Science Through Trading Robots How to get students interested in algorithms, combinatorial.
SDG Mittagsseminar1 Using Artificial Markets to Teach Computer Science Through Trading Robots How to get students interested in algorithms, combinatorial.
February 18, 2015CS21 Lecture 181 CS21 Decidability and Tractability Lecture 18 February 18, 2015.
4 x1 4 10/18/2015 Know Your Facts!. 5 x /18/2015 Know Your Facts!
3 x0 0 10/18/2015 Know Your Facts!. 11 x /18/2015 Know Your Facts!
2 pt 3 pt 4 pt 5pt 1 pt 2 pt 3 pt 4 pt 5 pt 1 pt 2pt 3 pt 4pt 5 pt 1pt 2pt 3 pt 4 pt 5 pt 1 pt 2 pt 3 pt 4pt 5 pt 1pt X mixed # equations dividing fractions.
Software Development using artificial markets of constructively egoistic agents Karl Lieberherr 1SD-F09.
Approximating Market Equilibria Kamal Jain, Microsoft Research Mohammad Mahdian, MIT Amin Saberi, Georgia Tech.
Add and subtract Rationals with Unlike denominators.
A item is marked 25% off and then you are given an additional discount of 10%. What will you pay? Are receiving a total of 35% off? Explain why or why.
Unit 15 International trade (Continued). PRACTICE Like + N, NP, Pronoun e.g.: Do like me! As + clause e.g.: Do as I do! Beginning in different way.
Managing Software Development Karl Lieberherr. Manage a significant program from requirements to implementation We wrote requirements. We wrote several.
A store pays $1.50 for a bag of candy. If the store wants to mark-up the price 60%, how much will the store sell the bag of candy for? 100% = $ %
NP Completeness Piyush Kumar. Today Reductions Proving Lower Bounds revisited Decision and Optimization Problems SAT and 3-SAT P Vs NP Dealing with NP-Complete.
2 pt 3 pt 4 pt 5pt 1 pt 2 pt 3 pt 4 pt 5 pt 1 pt 2pt 3 pt 4pt 5 pt 1pt 2pt 3 pt 4 pt 5 pt 1 pt 2 pt 3 pt 4pt 5 pt 1pt Like fractions Adding unlike fractions.
CSCI 2670 Introduction to Theory of Computing December 2, 2004.
CSC 3130: Automata theory and formal languages Andrej Bogdanov The Chinese University of Hong Kong NP-complete.
Non-LP-Based Approximation Algorithms Fabrizio Grandoni IDSIA
Market Liquidity & Performance Monitoring Holmstrom & Tirole (1993) By James Song Feb 4, 2007.
Each day you will…. 1. Receive 2 terms and definitions per day 2. Copy a term and definition 3. Write the term in a sentence 4. Repeat At the end of this.
Chapter 4 : Integral Calculus. Introduction: Anti- derivatives if given derivative of a function we can work backwards to find the function from which.
An inner product on a vector space V is a function that, to each pair of vectors u and v in V, associates a real number and satisfies the following.
 2005 SDU Lecture15 P,NP,NP-complete.  2005 SDU 2 The PATH problem PATH = { | G is a directed graph that has a directed path from s to t} s t
Topic 5 Modeling with Linear and Quadratic Functions 5.7 The Quadratic Formula and the Discriminant.
ICS 353: Design and Analysis of Algorithms NP-Complete Problems King Fahd University of Petroleum & Minerals Information & Computer Science Department.
NP-Completeness A problem is NP-complete if: It is in NP
NP-Completeness (2) NP-Completeness Graphs 4/13/2018 5:22 AM x x x x x
Subtraction Addition Multiplication Fractions Division 1pt 1 pt 1 pt
Factoring Unit 2 Day 4 review from algebra 1-2
NP-Completeness (2) NP-Completeness Graphs 7/23/ :02 PM x x x x
NP-Completeness (2) NP-Completeness Graphs 7/23/ :02 PM x x x x
NP-Completeness Proofs
(xy)(yz)(xz)(zy)
NP-Completeness (36.4-5/34.4-5)
Factorization by Cross-method
NP-Completeness (2) NP-Completeness Graphs 11/23/2018 2:12 PM x x x x
NP-Completeness Proofs
!'!!. = pt >pt > \ ___,..___,..
Learn Your 2x Facts.
Add and subtract Rationals with Unlike denominators
Designing Algorithms for Multiplication of Fractions
Warm Up Use long division to find (6
CSE 589 Applied Algorithms Spring 1999
NP-Completeness (2) NP-Completeness Graphs 7/9/2019 6:12 AM x x x x x
Presentation transcript:

Algorithmic Derivative Trading

Types for CNFs Type of a clause: –Pair: (length, positive literals) –Example: (2,2) for (a or b) Type of a cnf: –Set union of types of clauses –Example: T = ((2,2) (1,0)) for (a or b) and (b or c) and !a and !b and !c

CNF type as derivative Determine price p in [0,1] for derivative T, e.g., price for ((2,2) (1,0)). When I buy your derivative T at a price p you have the obligation to give me a cnf of type T and the fraction of the clauses that I can satisfy you have to pay me. What is your price for derivative T?

Fact There is a unique price p(T) for derivative T: –p > p(T) you make money –p <p(T) you lose money –Assumes that I have only polynomial time available, e.g., quadratic polynomial time.