System and method for dynamic path- and state-dependent...

Data processing: financial – business practice – management – or co – Automated electrical financial or business practice or... – Finance

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C705S035000, C705S03600T, C705S03600T, C703S023000, C463S006000

Reexamination Certificate

active

08032451

ABSTRACT:
The invention includes a system and process that employs contractual bargaining with agent-based computational methods for the dynamic allocation, optimization, and pricing of contingent rights and obligations between multiple counterparties with overlapping interests. The processes employ a dynamic and endogenous hierarchy or tiering of binding incentive compatible contingent strategies, which may include optimal liquidation policies for matched assets and liabilities based upon stochastic volume/price schedule related to statistically non-stationary supply/demand elasticities and order-flow, as well as variations in market microstructure. The invention includes a dynamic open system with distributed stochastic control of strategic interactions among dynamic optimizing agents across random states, wherein the actions of any one affects the joint costs and benefits for all the agents.

REFERENCES:
patent: 6321212 (2001-11-01), Lange
patent: 7340433 (2008-03-01), Kay et al.
patent: 7395232 (2008-07-01), Pilato
patent: 7440909 (2008-10-01), Puri et al.
patent: 7590589 (2009-09-01), Hoffberg
patent: 7693778 (2010-04-01), Nafeh
patent: 7774191 (2010-08-01), Berkowitz et al.
patent: 2001/0027437 (2001-10-01), Turbeville et al.
patent: 2001/0032176 (2001-10-01), Starkman
patent: 2002/0057343 (2002-05-01), Ronk et al.
patent: 2002/0065752 (2002-05-01), Lewis
patent: 2002/0111891 (2002-08-01), Hoffman et al.
patent: 2002/0123951 (2002-09-01), Olsen et al.
patent: 2002/0138416 (2002-09-01), Lovejoy et al.
patent: 2002/0184142 (2002-12-01), Whang
patent: 2003/0023546 (2003-01-01), Shepherd
patent: 2004/0088245 (2004-05-01), Narayan et al.
patent: 2004/0162772 (2004-08-01), Lewis
patent: 2004/0215551 (2004-10-01), Eder
patent: 2005/0027645 (2005-02-01), Lui et al.
patent: 2005/0071266 (2005-03-01), Eder
patent: 2005/0197857 (2005-09-01), Avery
patent: 2005/0216402 (2005-09-01), Dubey et al.
patent: 2005/0222943 (2005-10-01), Monteleone et al.
patent: 2007/0106601 (2007-05-01), Shepherd
patent: 2007/0239577 (2007-10-01), Grody et al.
patent: 2007/0265959 (2007-11-01), Hollis et al.
patent: 2007/0294156 (2007-12-01), Hughes et al.
patent: 2008/0126268 (2008-05-01), Sugahara
patent: 2008/0201257 (2008-08-01), Lewis et al.
patent: 2008/0215480 (2008-09-01), Mordecai
patent: 2009/0281891 (2009-11-01), Walker et al.
patent: 2010/0023460 (2010-01-01), Hughes et al.
patent: 2011/0004566 (2011-01-01), Berkowitz et al.
patent: 2011/0081955 (2011-04-01), Lange et al.
patent: WO 00/16232 (2000-03-01), None
patent: WO 01/50306 (2001-07-01), None
Tuomas W. Sandholm, Leveled Commitment Contracts and Strategic Breach, Games and Economic Behavior, vol. 35, No. 1-2, pp. 212-270, Apr.-May 2001.
International Search Report and Written Opinion in International Application No. PCT/US2008/02389.
Ref. U = Gupta et al., Decision Support Systems for Small Business, Journal of Systems Management; Feb. 1989, vol. 40, Issue 2; p. 37.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

System and method for dynamic path- and state-dependent... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System and method for dynamic path- and state-dependent..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for dynamic path- and state-dependent... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4254291

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.