Abstract: The present invention provides an improved system and method for using cryptography to secure computer-implemented choice mechanisms. In several preferred embodiments, a process is provided for securing participants' submissions while simultaneously providing the capability of validating their submissions. This is referred to as a random permutation. In several other preferred embodiments, a process is provided for securing participants' advance instructions while simultaneously providing the capability of validating their advance instructions. This is referred to as a secure advance instruction. Applications include voting mechanisms, school choice mechanisms, and auction mechanisms.

Abstract: The present invention provides an improved system and method for using cryptography to secure computer-implemented choice mechanisms. In several preferred embodiments, a process is provided for securing participants’ submissions while simultaneously providing the capability of validating their submissions. This is referred to as a random permutation. In several other preferred embodiments, a process is provided for securing participants’ advance instructions while simultaneously providing the capability of validating their advance instructions. This is referred to as a secure advance instruction. Applications include voting mechanisms, school choice mechanisms, and auction mechanisms.

Abstract: The present invention provides an improved system and method for using cryptography to secure computer-implemented choice mechanisms. In several preferred embodiments, a process is provided for securing participants' submissions while simultaneously providing the capability of validating their submissions. This is referred to as a random permutation. In several other preferred embodiments, a process is provided for securing participants' advance instructions while simultaneously providing the capability of validating their advance instructions. This is referred to as a secure advance instruction. Applications include voting mechanisms, school choice mechanisms, and auction mechanisms.

Abstract: The present invention provides an improved system and method for using cryptography to secure computer-implemented choice mechanisms. In several preferred embodiments, a process is provided for securing participants' submissions while simultaneously providing the capability of validating their submissions. This is referred to as a random permutation. In several other preferred embodiments, a process is provided for securing participants' advance instructions while simultaneously providing the capability of validating their advance instructions. This is referred to as a secure advance instruction. Applications include voting mechanisms, school choice mechanisms, and auction mechanisms.

Abstract: The present invention provides an improved system and method for using cryptography to secure computer-implemented choice mechanisms. In several preferred embodiments, a process is provided for securing participants' submissions while simultaneously providing the capability of validating their submissions. This is referred to as a random permutation. In several other preferred embodiments, a process is provided for securing participants' advance instructions while simultaneously providing the capability of validating their advance instructions. This is referred to as a secure advance instruction. Applications include voting mechanisms, school choice mechanisms, and auction mechanisms.

Abstract: The present invention provides an improved system and method for using cryptography to secure computer-implemented choice mechanisms. In several preferred embodiments, a process is provided for securing participants' submissions while simultaneously providing the capability of validating their submissions. This is referred to as a random permutation. In several other preferred embodiments, a process is provided for securing participants' advance instructions while simultaneously providing the capability of validating their advance instructions. This is referred to as a secure advance instruction. Applications include voting mechanisms, school choice mechanisms, and auction mechanisms.

Abstract: The present invention provides an improved system and method for using cryptography to secure computer-implemented choice mechanisms. In several preferred embodiments, a process is provided for securing participants' submissions while simultaneously providing the capability of validating their submissions. This is referred to as a random permutation. In several other preferred embodiments, a process is provided for securing participants' advance instructions while simultaneously providing the capability of validating their advance instructions. This is referred to as a secure advance instruction. Applications include voting mechanisms, school choice mechanisms, and auction mechanisms.

Abstract: The present invention provides an improved system and method for using cryptography to secure computer-implemented choice mechanisms. In several preferred embodiments, a process is provided for securing participants' submissions while simultaneously providing the capability of validating their submissions. This is referred to as a random permutation. In several other preferred embodiments, a process is provided for securing participants' advance instructions while simultaneously providing the capability of validating their advance instructions. This is referred to as a secure advance instruction. Applications include voting mechanisms, school choice mechanisms, and auction mechanisms.

Abstract: The present invention provides an improved system and method for using cryptography to secure computer-implemented choice mechanisms. In several preferred embodiments, a process is provided for securing participants' submissions while simultaneously providing the capability of validating their submissions. This is referred to as a random permutation. In several other preferred embodiments, a process is provided for securing participants' advance instructions while simultaneously providing the capability of validating their advance instructions. This is referred to as a secure advance instruction. Applications include voting mechanisms, school choice mechanisms, and auction mechanisms.

Abstract: The present invention provides an improved system and method for using cryptography to secure computer-implemented choice mechanisms. In several preferred embodiments, a process is provided for securing participants' submissions while simultaneously providing the capability of validating their submissions. This is referred to as a random permutation. In several other preferred embodiments, a process is provided for securing participants' advance instructions while simultaneously providing the capability of validating their advance instructions. This is referred to as a secure advance instruction. Applications include voting mechanisms, school choice mechanisms, and auction mechanisms.

Abstract: The present invention provides an improved system and method for using cryptography to secure computer-implemented choice mechanisms. In several preferred embodiments, a process is provided for securing participants' submissions while simultaneously providing the capability of validating their submissions. This is referred to as a random permutation. In several other preferred embodiments, a process is provided for securing participants' advance instructions while simultaneously providing the capability of validating their advance instructions. This is referred to as a secure advance instruction. Applications include voting mechanisms, school choice mechanisms, and auction mechanisms.

Abstract: The present invention provides improvements applicable to dynamic auctions such as clock auctions or combinatorial clock auctions. In a first embodiment, the present invention includes an improved activity rule that constrains the bids that may be submitted by a bidder, based on the bidder's own prior bids, In a second embodiment, the present invention includes an improved pricing rule that appropriately discounts the amounts (as compared to linear pricing) of bids that need to be submitted by a bidder. In a third embodiment, the present invention includes an improved iterative first-price auction. Bidders successively make bids, often a bid for a package of items at a specified price. When the auction concludes, some of these bids become “winning” bids; the respective bidders win the items specified in their winning bids and pay the prices specified in their winning bids. In some preferred embodiments, the present invention combines two or all three of these improvements.

Abstract: The present invention provides an improved system and method for using cryptography to secure computer-implemented choice mechanisms. In several preferred embodiments, a process is provided for securing participants' submissions while simultaneously providing the capability of validating their submissions. This is referred to as a random permutation. In several other preferred embodiments, a process is provided for securing participants' advance instructions while simultaneously providing the capability of validating their advance instructions. This is referred to as a secure advance instruction. Applications include voting mechanisms, school choice mechanisms, and auction mechanisms.

Abstract: One aspect of our invention is a new class of rationing rules with disproportionate rationing that motivates bidders to submit more competitive bids. A second aspect of our invention is that competitiveness of bids can be further improved if the rationing rule is different for different price levels. A third aspect is that a bidding format that controls the shape of bids can improve competitiveness of bids, especially when combined with a suitable rationing rule. A fourth aspect is that competitiveness of bids can be further improved if the bidding format and/or rationing rule is automatically updated with regard to new auction relevant information before the auction starts or during the auction process. A fifth aspect is that perceived fairness can be improved if the rationing rule considers the size of bidders. Several aspects of our invention can be combined in an exemplary design. Some aspects of our invention can also be applied to single-object auctions.

Abstract: The present invention is a system and method to sell or procure complementary goods. complementary good according to the invention is a good whose value or utility is enhanced when paired with another good, such a pair of goods is a communication license to encumbered spectrum and a complementary clearing right to clear the spectrum of its encumbrance. The invention provides automated procedures to facilitate the fashioning and sale of clearing rights so as to enhance the value of the communications license.

Abstract: An improved system and method for a computer-implemented auction in which multiple types of items are auctioned together without imposing a particular division of supply or demand among the individual types of items. In some embodiments the auction of the present invention provides a means or method for establishing prices for the types of items, wherein the prices maintain a relationship. In other embodiments, the present invention provides a means or method for implying prices from price parameters in the bids received form bidders, based on a relation among the prices for the types of items. Market clearing may be defined by the condition that the aggregate quantity bid for all types of items is less than or equal to the available quantity of all types of items. The division among the types of items within is thus determined flexibly, based on the bids at the associated prices.

Abstract: The present invention is a system and method for a computer-implemented auction, based on a system with multiple bidder and auctioneer computers or terminals (20a-n,30) communicating with the server (10) over a network (40). The computers (20a-n) are employed by bidders, the computer (30) is employed by the auctioner, and the server (10) is the auction computer. That server consist of a CPU (11), memory (12), a data storage device (13), a communication interface (140), a clock (150), an operating system (16), and an auction program (17). In one embodiment, the system architectura is as a client-server system: the auction computer is a server; and the bidder and auctioneer are clients.

Abstract: The present invention provides improvements applicable to dynamic auctions such as clock auctions or combinatorial clock auctions. In a first embodiment, the present invention includes an improved activity rule that constrains the bids that may be submitted by a bidder, based on the bidder's own prior bids. In a second embodiment, the present invention includes an improved pricing rule that appropriately discounts the amounts (as compared to linear pricing) of bids that need to be submitted by a bidder. In a third embodiment, the present invention includes an improved iterative first-price auction. Bidders successively make bids, often a bid for a package of items at a specified price. When the auction concludes, some of these bids become “winning” bids; the respective bidders win the items specified in their winning bids and pay the prices specified in their winning bids. In some preferred embodiments, the present invention combines two or all three of these improvements.

Abstract: This invention defines a computer system for conducting an auction of a plurality of items including outputting prices for items, receiving bids, outputting updated prices and receiving further bids and then determining an allocation of at least one of the items.

Abstract: An improved system and method for a computer-implemented auction in which multiple types of items are auctioned together without imposing a particular division of supply or demand among the individual types of items. In some embodiments the auction of the present invention provides a means or method for establishing prices for the types of items, wherein the prices maintain a relationship. In other embodiments, the present invention provides a means or method for implying prices from price parameters in the bids received form bidders, based on a relation among the prices for the types of items. Market clearing may be defined by the condition that the aggregate quantity bid for all types of items is less than or equal to the available quantity of all types of items. The division among the types of items within is thus determined flexibly, based on the bids at the associated prices.