scholarly journals Maximum Matching and Linear Programming in Fixed-Point Logic with Counting

Author(s):  
Matthew Anderson ◽  
Anuj Dawar ◽  
Bjarki Holm
1997 ◽  
Vol 1 (2) ◽  
pp. 133-150 ◽  
Author(s):  
Henry Schellhorn

We model the exchange of commodities that are contingent upon each other, when traders place mostly limit orders. Examples include: 1) a market of financial futures where future spreads are also traded, 2) a market of mutual funds and stocks, 3) a market of options and stocks, under the viewpoint that they are both combinations of Arrow-Debreu securities. We prove that consistent prices are optimal. We develop a fixed-point algorithm to compute an optimal price and allocation. The algorithm combines ideas from contraction mapping theory and from homotopy theory. It is much faster than a traditional linear programming approach.


2003 ◽  
Author(s):  
Robin R. Vallacher ◽  
Andrzej Nowak ◽  
Matthew Rockloff
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document