Abstract: A system, method, apparatus, and computer program code for conducting a buy-side auction includes defining a plurality of transformation functions available for use in the auction. An offer to sell the item requested in the auction is received from a seller, and at least one transformation function is identified, based at least in part on the offer or the seller. The selected transformation function is applied to the offer to produce a transformed offer, and a state of the auction is updated based on the transformed offer.

Abstract: A system, method, apparatus, and computer program code for conducting a two-sided auction include defining a plurality of transformation functions available for use in the auction. A bid for an item offered in the auction is received, and at least one transformation function is identified, based at least in part on the bid or the buyer or the seller. The selected transformation function is applied to the bid to produce a transformed bid, and a state of the auction is updated based on the transformed bid. An offer for an item offered in the auction is received, and at least one transformation function is identified, based at least in part on the offer or the seller. The selected transformation function is applied to the offer to produce a transformed offer, and a state of the auction is updated based on the transformed offer.

Abstract: An auction is conducted by receiving, from a participant, a request for an item. An auction for the item is identified and a bid for the item is received from the participant. The received bid is forwarded to an auction for the item. In some embodiments, a transformation function associated with the participant is identified and applied to the bid to produce a transformed bid. The transformation function reflects different information about participants, the items, or the auctions (e.g, participants from different industries or from different countries).

Abstract: A system, method, apparatus, and computer program code for facilitating the sale of an item in an auction involving a plurality of participants includes identifying a bid for the item, the bid made by one of the participants. A desired configuration associated with the bid is then identified. The bid is modified to reflect the desired configuration. A status of the auction is updated based on the modified bid.

Abstract: A system, method, apparatus, and computer program code for conducting a sell-side auction process includes defining a plurality of transformation functions available for use in the auction. A bid for the item offered in the auction is received, and at least one transformation function is identified, based at least in part on the bid or the buyer. The selected transformation function is applied to the bid to produce a transformed bid, and a state of the auction is updated based on the transformed bid.

Abstract: A system, method, apparatus, and computer program code for establishing customized financing terms includes identifying a bid for an item, identifying a financing function associated with a participant, and applying the financing function to the bid to generate a transformed bid reflecting customized financing terms.

Abstract: A system, method, apparatus, and computer program code for personalized dynamic pricing in an auction involving a plurality of participants is provided. A bid for an item is identified. A transformation function associated with the bid is then identified and applied to the bid to produce a transformed bid. According to one embodiment, a state of the auction is updated based on the transformed bid. Status data representing the state of the auction may then be generated and presented to one or more participants in the auction.

Abstract: A method for routing data packets correctly and efficiently among a plurality of hosts in a multicast is disclosed. The hosts are connected to a packet switching network comprising a plurality of packet switches interconnected by trunks. A memory associated with the route controller in each switch maintains a table whose entries are tuples of the form <address, trunk identification number, time>. In the case of multicast routing, the address is a multicast address. The trunk identification number is a number which uniquely identifies each of the trunks connected to the switch. Time is a timing parameter which is initially set to a certain predetermined value (designated Maxtime herein) and decremented periodically. When time reaches zero, the associated table entry is cleared. When a host wishes to join a multicast conversation (even if it is the first participant), it simply transmits a packet from itself to the multicast adddress. This packet will be broadcast over the entire spanning tree network.