System and method for conducting combinatorial exchanges
View Patent ↗A double-sided exchange may be an exchange wherein both buyers and sellers provide bids for matching via the exchange. A first interface receives buy bids from buyers and a second interface receives sell bids from sellers. A controller matches the sell bids with the buy bids, yielding matched buy bids and matched sell bids in response thereto so that allocations of the matched buy bids and the matched sell bids maximize a surplus of the exchange. An allocation that substantially maximizes an auctioneer's profit and/or announces payments based on sell bids is provided. The announced allocations and prices can be shown to be a substantially competitive equilibrium in some applications.
1. A method for implementing a double exchange by using a controller coupled to a network, the method comprising:
accepting a first set of buy bids from buyers via a buyer interface, wherein the first set of buy bids are transferred to the controller over the network;
receiving a first set of sell bids from sellers via a seller interface, wherein the first set of sell bids are transferred to the controller over the network;
matching, by an optimization engine in the controller, one or more sell bids with one or more buy bids, yielding one or more matched buy bids and one or more matched sell bids in response thereto;
determining, by the optimization engine in the controller, a uniform settlement price based on a highest ask price among one or more matched sell bids;
scheduling payments so that matched buyers pay a sum of the settlement prices of items in a matched bid for a bundle of the items, and so that matched sellers receive a payment equal to the number of items sold multiplied by the settlement price for a particular item; and
transferring an indication of the scheduled payments to one or more of the buyers or sellers, wherein the indication is transferred over the network.
2. The method of claim 1 , wherein the one or more buy bids each include a buy price per bundle, wherein each bundle includes up to (δ i ) items or things.
3. The method of claim 2 , wherein the one or more buy bids further specify maximum bundles needed and maximum bundles demanded for a given buy bid.
4. The method of claim 1 , wherein the one or more sell bids each include a sell price per item or thing, a maximum number of items or things offered; and maximum supply.
5. The method of claim 4 , wherein the optimization engine further determines allocations for units sold and allocations of units bought so as to maximize auction surplus.
6. The method of claim 5 , wherein the optimization engine operates with a constraint specifying that supply is greater than demand.
7. The method of claim 6 , wherein the optimization engine implements a Mixed Integer Program (MIP).