MULTIFACTORIAL OPTIMIZATION SYSTEM AND METHOD
First Claim
14. A networking system comprising:
- a network model, said model comprising a set of stored values representing estimates of a dynamically changing automated communication network;
a communication control, configured to automatically control communications through the dynamically changing automated communication network in dependence on said network model; and
an arbitrage agent, comprising at least one automated processor, configured to engage in an automatic arbitrage transaction with respect to a risk that said set of stored values representing estimates of the dynamically changing communication network are incorrect.
0 Assignments
0 Petitions
Accused Products
Abstract
A method for providing unequal allocation of rights among agents while operating according to fair principles, comprising assigning a hierarchal rank to each agent; providing a synthetic economic value to a first set of agents at the a high level of the hierarchy; allocating portions of the synthetic economic value by the first set of agents to a second set of agents at respectively different hierarchal rank than the first set of agents; and conducting an auction amongst agents using the synthetic economic value as the currency. A method for allocation among agents, comprising assigning a wealth generation function for generating future wealth to each of a plurality of agents, communicating subjective market information between agents, and transferring wealth generated by the secure wealth generation function between agents in consideration of a market transaction. The method may further comprise the step of transferring at least a portion of the wealth generation function between agents.
-
Citations
23 Claims
-
14. A networking system comprising:
-
a network model, said model comprising a set of stored values representing estimates of a dynamically changing automated communication network; a communication control, configured to automatically control communications through the dynamically changing automated communication network in dependence on said network model; and an arbitrage agent, comprising at least one automated processor, configured to engage in an automatic arbitrage transaction with respect to a risk that said set of stored values representing estimates of the dynamically changing communication network are incorrect. - View Dependent Claims (15, 16, 17, 18, 19)
-
-
20. A method of routing a communication, comprising:
-
defining a source node, a destination node, and at least two intermediate nodes; estimating a network state of at least one of the intermediate nodes; arbitraging a risk with respect to an accuracy of the estimate of network state with an automated arbitrage agent, wherein the automated arbitrage agent automatically receives an economic payment to at least one of reduce the risk and better define the risk; and communicating between said source and said destination in dependence on the estimated network state, wherein the communication has an economic value which is statistically increased by the at least one of reduced risk and better defined risk, and the economic payment to the automated arbitrage agent is less than the increase in the economic value of the communication.
-
-
21. A method of optimizing an allocation of resources within members of a community, comprising:
-
(a) determining subjective resource value functions for a plurality of resources for members of the community; (b) selecting an allocation of resources, optimized within an error limit to maximize an aggregate economic surplus of the community; (c) charging members of the community in accordance with the allocation of resources and respective subjective resource value functions of respective members receiving an allocation; and (d) distributing at least a portion of the economic surplus to members who defer receiving an allocation of resources as a result of the selecting.
-
-
22. A method of optimizing a market, comprising:
-
(a) providing at least four parties comprising at least one buyer, at least one seller, and at least one deferring party with respect to a transaction; (b) matching bidders with offerors to maximize a surplus of the transaction; and (c) automatically determining the surplus and allocating a portion of the determined surplus to at least one of the at least one deferring party using at least one automated processor, to motivate deference. - View Dependent Claims (1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 23)
-
-
23-1. The method according to claim 22, wherein the transaction is an automatically conducted combinatorial auction.
Specification