Combinatorial portfolio aggregations in electronic trade. RU patent 2518995.

FIELD: physics, computer engineering.

SUBSTANCE: invention relates to data processing means, particularly combinatorial portfolio aggregation in electronic trade. The method involves receiving data associated with an offer for possession of at least one part of an item for a period of time, receiving additional data associated with at least one additional offer for possession of the at least one part of the item for at least one additional period of time, said period of time and the at least one additional period of time being non-concurrent, selectively aggregating said offer with the at least one additional offer into a portfolio offer for the at least one part of the item, and based on predetermined criteria, determining that the portfolio offer is a winning portfolio offer.

EFFECT: high reliability and shorter time for conducting a network auction.

14 cl, 21 dwg

THE TECHNICAL FIELD TO WHICH THE INVENTION RELATES

This application refers, in General, to process data and, in particular, to combinatorial portfolio aggregation in e-Commerce.

THE LEVEL OF TECHNOLOGY

Electronic trading transactions such as online auctions, as well as cash and non-cash currency other types, are becoming more popular. Traditional network auction is the process of selling goods single applicant offering the highest price. At the end of the traditional online auction the applicant offering the highest price, becomes the owner of the goods. The task of the traditional network of the auction is to maximize the amount paid to the seller for the goods. However, a potential buyer may require the goods only a certain period of time or only after a certain date. However, for possession of the goods for any short period of time a potential buyer has to buy goods with immediate payment in cash. On the other hand, the seller may want only the restoration of the right of ownership after some period of time or transfer ownership after a certain date, or both. Traditional network auction poorly suited to address these problems. In addition, the traditional network, the auction is not suitable for the creation of a market in which buyers want to take equity in the non-competitive (not implemented simultaneously) the right of possession of the goods.

SUMMARY OF THE INVENTION

Later in simplified form is a set of concepts that further described below in the section implementation izobreteniya. The present summary is not intended to determine the main features or significant distinguishing features of the object of the invention, and thus it is not intended to define the scope of the present invention.

According to one example, implemented with the use of computer method contains the time that: accept data associated with a proposal for a potential ownership and/or use of at least one part of the goods within a certain period of time, take extra data associated at least with one additional proposal regarding potential ownership and/or use of at least one part of a product, at least for one additional period of time where the specified period of time and at least one extended period of time are not the same, selectively aggregate the proposal, at least, with one additional suggestion portfolio in the proposal, at least one part of the goods and on the basis of given criteria will automatically detect whether or not the specified portfolio proposal is a winning portfolio proposal.

For example, implemented with the use of computer method additionally contains the time that award at least one part of a product, at least one applicant associated with the winning portfolio proposal. For example, the award of at least one part of the goods depends on the amount of portfolio offers, reaching a specified reserve price, if set to set the reserve price. For example, the seller or the applicant for the right of ownership associated with the proposal, can eliminate at least one additional suggestion, if the sum of portfolio offers exceeds the reserve price.

For example, set your reserve price may be reduced by the seller. For example, the aggregation continues until the expiry of the specified term the auction. For example, the data associated with the offer, contain an indication that the proposal can be aggregated at least one additional suggestion. For example, the seller may select the bid with the lowest price, or the applicant for the right of ownership may choose an application with a minimal amount of all other applicants within its portfolio of applications.

For example, the specified time period and at least one extended period of time can be selected from the group consisting of temporary periods of time and continuous time. For example, according to the method also gives the party associated with a constant period of time, to manage the aggregate portfolio of the application. For example, the constant time period begins with the given future date and/or is a set number of days after the transfer of ownership. For example, goods can be automatically selected at least one list of products that are more items, such specific item. For example, the proposal is monetary, non-monetary or exchange of goods and/or services. For example, the method also contains the stages, which shall inform the parties, in connection with the offer and, at least, with one additional suggestion that the adoption of the proposal includes the agreement on application of the specified penalties in case of violation.

Additional examples above steps ways stored on machine-readable media containing instructions that are in the fulfillment of at least one processor implement these steps. Other examples subsystem or devices can be made with the possibility of realization of the described stages. Other distinctive features, examples and ways of implementation are described below.

BRIEF DESCRIPTION OF DRAWINGS

Ways to make the present invention is shown as an illustration, but not limitation, to accompanying drawings, which are similar position numbers indicate similar items, and on which:

Figure 1 shows the functional diagram of a typical network environment in which the implemented systems and methods for combinatorial portfolio aggregation in e-Commerce according to one implementation variant.

Figure 2 shows the functional diagram of the machines for electronic Commerce under one implementation variant.

Figure 3-7 shows the block diagram of combinatorial methods portfolio aggregation in e-Commerce according to some variants of implementation.

On Fig schematically shows the approximate machine in the form of a computer system that executes a set of instructions that cause the implementation of at least one described in this application methods.

Figure 9 shows the first part of the block diagram of the method of combinatorial portfolio aggregation in e-Commerce, use the queue pipeline proposals according to one implementation variant.

Figure 10 shows the second part of the block diagram of the method of combinatorial portfolio aggregation in e-Commerce, use the queue pipeline proposals according to one implementation variant.

Figure 11 shows the block diagram of how the groups of buyers and sellers under one implementation variant.

On Fig shows the block diagram of the method of combinatorial portfolio aggregation in electronic Commerce, using escrow, according to one implementation variant.

On Fig shows a block diagram of how the demonstration of the product according to one implementation variant.

On Fig and 15 shows the block diagram of the method of combinatorial portfolio aggregation in electronic Commerce, using Docker of the applicant, according to one implementation variant.

On Fig shows the block diagram of the method of combinatorial portfolio aggregation in electronic Commerce, using Docker of the applicant according to one implementation variant.

On Fig shows the block diagram of the method of combinatorial portfolio aggregation in electronic Commerce, using different interface devices, according to one implementation variant.

On Fig shows the block diagram of the method of combinatorial portfolio aggregation in electronic Commerce, using Docker of the applicant, according to one implementation variant.

On Fig-21 shows the block diagram of the method of combinatorial portfolio aggregation in electronic Commerce, using at least one of your friends or partners, according to one implementation variant.

THE IMPLEMENTATION OF THE INVENTION

Below are examples of methods and systems for combinatorial portfolio aggregation in e-Commerce. The following description for the purposes of clarity of the explanations given numerous specific details for a full understanding of the model implementation options. However, for professionals in the art should be obvious that the present invention may be carried out without these specific details.

According to some versions of the implementation of methods and systems for combinatorial portfolio aggregation in electronic Commerce can be used for network trade transactions, in which the buyers offer prices at least one period of time uncompetitive possession of the goods or non-competitive ownership of at least one part of the goods, and the proposal can be portfolio offer several buyers. The goods may represent at least one of such goods mentioned at least one seller. Possession may include the period of temporary ownership with the right of ownership, starting with a deal, at least after one temporary ownership or as deferred ownership. Systems and methods described in this application can be used in monetary and non-monetary transactions.

In traditional network trade auction winner takes full ownership of the goods at the end of the auction. In case of bidding for the lease of the winning bidder shall take possession of the goods, and the right of ownership back to the seller at the expiration of the lease, or the tenant may have the opportunity to buy the specified product at the end of the lease. Thus, potential buyers are competing for the goods, although they have no need to own the goods at the same time. Methods and systems for combinatorial portfolio aggregation in e-Commerce enable applicants bidding for the right to possession of the goods uncompetitive in the appropriate periods of time and at the same time potentially increase the amount of applications by combining relevant proposals. Thus, for example, a student may make a bid for ownership of the textbook for one semester, while another student may make a bid for ownership of the textbook for another semester, and aggregate supply will contain the sum of both proposals.

Thus, according to some versions of the implementation of methods and systems for combinatorial portfolio aggregation in e-Commerce allows multiple applicants bidding within the group and to combine their individual proposals in the group portfolio proposal. If the group portfolio, the proposal is declared the winning offer, the group of applicants related to the winning proposal shall share of non-competitive possession of the goods. The possession of goods are divided among the members in accordance with the time periods or the number of days stated in their respective proposals. According to some versions of the implementation of one member of the group may be the ultimate owner of the goods. According to other options exercise of the right of ownership of the goods back to the seller after the expiry of the term of temporary ownership of all group members. According to other factors implement the seller may not indicate who is the ultimate owner. In this case, any member of the group may be the ultimate owner of the goods until such time as the other auctions will not be generated another transfer of the goods. Criteria transaction and responsibilities of the parties are determined by the seller.

According to some variants of implementation, the seller can offer long-term contracts on when and how to sell the goods, which the customers can be sold goods, as well as the criteria according to which selects the ultimate owner. Therefore, the transaction can be the ultimate sale in which the seller no longer owns the product or not rents it, and as a result of which the seller or a member of the group relating to the winning portfolio of the application receive the goods back after a specified amount of time. The applicant offering the highest price, may not be the winning bidder, as the goods can be provided portfolio proposal and the individual applicants. In addition, the applicant offering the highest price, may not be the ultimate owner, as, for example, the seller reserves the right of final possession of the goods, or the application for final possession of the goods does not constitute an order with the highest price in the winning portfolio proposal. Sold goods may be executed in any physical or digital format. The goods are not limited to the physical goods and may include services.

According to some variants of implementation after the start of bidding, the bidder who wishes to get the right end possession of the goods, can open the application portfolio and then allow other participants to integrate their applications with its application. According to some versions of the exercise of the applicant may grant such permission on combining applications implicitly by specifying a date, which should begin its ownership of the goods, or the total number of days in advance of its ownership of the goods. Other applicants may join the bidding portfolio by offering their prices on the possession of goods, and their applications remain in force until a certain date, expires or within a certain number of days, starting from the date of filing the application. It should be understood that described below options for implementation are not limited to a specific type of trading operations and can be implemented in transactions of any type.

According to some versions of the implementation buyers can make a request for the goods within the portfolio of the application by selecting its own reserve price and preferred time of execution of the transaction. If the time selected by the applicant exceeds the date of expiration of trading, portfolio and the application is not winning bid, or not at all proved to be the winning candidates, the seller may re-list the item for sale and to include the mentioned application to the new application portfolio for this product. According to some versions of the implementation of the seller may be aggregated orders and transactions even under the condition that the reserve price is not met. In this case, the seller may retain the right of ownership of the goods.

According to some versions of the implementation of the buyer can specify the reserve price for the right to possession of the goods without specifying the date of expiration of the application. If at least two buyers are bidding for the right of ownership, the bidder who submitted a bid for the right to ownership may wish to resell it to the applicants, offering a lower price, after some period of time. For example, in the case of textbooks for College, the applicant offering the highest price, may resell tutorial applicants, offering lower prices, after 5 months. According to some versions of the implementation of the portfolio application may require the applicant to the ultimate ownership of the goods. In this case, the final right of ownership may return to the seller. Depending on the set of criteria for bidding, the seller may select a buyer, remaining in the ownership of the goods until such time as the result of new trades the goods will not pass to another buyer.

According to some versions of the implementation of the seller may wish to sell the goods at some date in the future. Potential buyers can be confident that such goods will need them after that date in the future. To facilitate the process of sale the seller may offer an option contract, according to which a prospective buyer pays for the right of the transaction. According to some other variants of implementation of the seller may impose a fine, if the customer violates the terms of the contract and the transaction is not performed according to the option contract.

According to some versions of the implementation of the owner of the goods may allow applicants to offer cash and at the same time allow to take equity and/or to give the product free of charge at the specified time periods in the absence of applicants, offering cash. In this case, the applicant has to offer $ 0 US. Transfer of goods may be performed according to the chronological order of applications, the latter the applicant in the group remained in the ownership of the goods until such time as the next applicant or group of applicants will not require the specified goods. Under this variant of realization of the applicant, which offers cash, with the consent of the seller may have an advantage over other applicants offering 0$, or applicants, offering a small amount of money.

According to some versions of the implementation of the seller may allow Docker-the applicant (docker bidder), which is the last applicant, who owns the goods when the goods are not returned to the owner, and there is no applicant of the right of ownership of the goods. For example, Docker-the applicant may be selected from applicants for this portfolio, individually offering price for the right to be Docker by the applicant, or the applicant of this portfolio, offering the highest price, determines who should be Docker by the applicant. Docker applicants may pay contributions and receive contributions. Criteria for determining Docker-the applicant can be asked by the seller. According to some versions of the implementation of the applicants can bid by device user interface of different types. To assist applicants in the formation of the proposals, at least, with one key word or can be used shortcuts.

Offered for auction goods can be linked with friends seller, so applicants who are friends of the seller, or other buyers that we have entered into transactions with the seller, can be the first informed about their ratings and comments or of exceptional views, for its friends and partners on General business, in addition to public ratings. This approach provides a deeper level of awareness of the applicant at the time of adoption of the decision on the placement of the application and the amount of the application. In addition, the collection of the necessary information can be made on the basis of different sources, such as friends, goods, description, and/or identification of the goods.

According to some versions of the implementation sellers can use different ways to sell products. Sellers can use the option of selling a single buyer for one price, group of customers at a different price, single buyer on the auction price or to all customers without a price. Sellers can attract customers by various means such as advertising, headers, links, mobile application or the search results. Regardless of the means used sellers can provide the information or to provide buyers with the opportunity to apply and complete the transaction immediately in the advertising, headers, links, mobile applications or search results. In addition, the transaction can be facilitated through redirected links. Payment made by the sellers for the use of such funds may vary, depending on the current market value of advertising or on the basis of actual sales. Sellers can apply discounts, group rates or distribute the product for free to attract buyers.

According to some versions of the implementation of the seller may use different ways of formation of charges, duration, ownership, group of applicants and various other variables, it prompts you for making lists of goods for sale. You should understand that according to some versions of the implementation of the bidding process can be set in such a way as to give the seller the opportunity to choose the buyer on the basis of different criteria in addition to the amount of monetary claims. These criteria may include the creditworthiness of the applicant. For example, the seller may prefer potential buyers financed with the use of escrow accounts. Other criteria may also include a reputation as a buyer, estimated on the basis of feedback from the user community.

Next, it will be assumed that the methods of combinatorial portfolio aggregation in e-Commerce, described in this application are not limited aggregation of applications on the basis of applications for non-competitive possession. Can be used for other aggregation methods, allowing the buyer to pay less and yet to own product or use of the goods. In addition, unlike traditional trade operations or sales, the seller may reduce the price of the transaction after the expiration time of trading. In addition, the seller may perform transactions with the monetary claims and/or with some non-monetary claims, or all non-monetary claims.

Figure 1 shows the functional diagram of a typical network environment 100, which according to one version the implementation can be carried out in the proposed system and method for the combinatorial portfolio aggregation in e-Commerce. As shown in figure 1, a typical network environment 100 can contain network 110, user interfaces, 120, base 130 data and 200 machine for electronic Commerce. The network of 110 can contain multiple nodes for data processing, interconnected to transfer data. Other components of the network environment 100 can use the network of 110 to receive, transfer and store data, and to gain access to remote resources.

Base 130 data can be used to save the data processed by the machine 200 for electronic Commerce. According to some versions of the implementation of the data stored in the database 130 of data that may result from the transaction, which is external to 200 machine for electronic Commerce. Base 130 data can also save the data related to the various market participants, who in the transaction are parties. These market participants may include buyers, sellers, applicants on trades, trading observers or any other parties involved in online transactions. User interfaces can contain 120 different devices to facilitate the transfer and receive data through the network of 110. User interfaces 120 allow market participants to interact with the machine 200 for electronic Commerce.

Machine 200 for electronic Commerce can be used for the processing of transactions in e-Commerce. Transactions in e-Commerce may include the purchase and sale of items or services over electronic systems such as the Internet and other computer networks. Numerous variety of e-business can be done electronically via the network of 110 and processed machine 200 for electronic Commerce. These transactions may include the transfer of funds, online transaction processing, electronic data interchange, automated inventory management and automated data collection. Machine 200 e-Commerce can use the network environment 100, at least at some point in the operating cycle of a transaction, although it can contain a wide range of technologies. Machine 200 e-Commerce e.g. with reference to Figure 2.

The processing block 208 can process the data according to the rules of trading and facilitate the observance of these rules. Data can be stored in the 130 data (not shown). The seller may specify trading form, containing the terms, minimum or maximum rates deals and special rules for determining the winner of the applicant or applicants, as well as the price or the sale price. The processing block 208 can facilitate the trading process according to the nature of the auction and the conditions specified by the seller. Trades can be direct, in which the seller is offering party and the objective of the proposal price is to increase the price, or conversely, where the traditional role of buyers and sellers reversed, and the objective of the proposal price is to reduce rates.

Bidders may know or may not know the authentication or actions of other participants. Methods of combinatorial portfolio aggregation in e-Commerce allows applicants to increase the amount of applications by combining their applications to portfolio application. The aggregation of applications easier aggregation unit 204. These methods are described in more detail below. Methods and systems for combinatorial portfolio aggregation in e-Commerce are not limited to trading activities and according to some variants of implementation can be used in the exchange of goods and/or services for other goods and/or services without a common medium of exchange. The award unit 206 facilitates the determination of the winning bid or the winning portfolio of the application.

According to some versions of the implementation of reputational block 210 can allow the seller to take into account the reputation of the potential buyer. For example, if reputational block determines that the potential buyer has a bad reputation regarding timely payments, the application associated with such a potential customer may be assigned to the reduced weight compared with the application that is associated with a potential buyer, have a better reputation with respect to the timely execution of payments.

Similarly, block 214 escrow can be used to account for the funds by using escrow associated with the Complainant, by assigning the increased weight of the application funded with conditional deposition. Other blocks 216 can be used to assign increased or decreased weight concrete proposals based on the specified criteria. Rating unit 212 can assess the data produced reputational block 210, block 214 escrow and other blocks 216, and assign the aggregate weight of the particular application. Aggregated weight together with the monetary costs associated with different applications, allow the seller to select the winning applicant.

Figure 3 shows a block diagram of the way 300 combinatorial portfolio aggregation in e-Commerce according to one implementation variant. The way 300 can be implemented by the manufacturing logic, which may contain hardware (such as specialized logic, programmable logic, microcode etc), software (which can be executed by a computer system General purpose or specialized machine), or a combination of both. According to one variant of realization of the processing logic is constantly in the car 200 e-Commerce, shown in figure 2.

The way 300 can be implemented using various blocks described above with reference to Figure 2. Each of these blocks can contain processing logic. The way 300 begins at the stage 302, where the receiving unit 202 receives the data associated with the proposal regarding the ownership, at least one part of the goods within a certain period of time. For example, in network trade textbooks, the applicant may indicate the period of time that coincides with the end of the semester in College. To facilitate the publication of such application user interfaces 120, shown in figure 1, can use the time shift that is associated with a list of items. The applicant may bid on the possession of goods at the end of the auction. In this case, the processing block 208 automatically detects that an application should not be aggregated with other applications. The applicant may also bid on the possession of goods, beginning with a specific future date, if the seller.

According to some variants of implementation, the applicant may indicate that its application should not be aggregated with other applications. In this case, this application would not be aggregated with additional applications. Otherwise, at the stage 304 receiving module 202 receives additional data associated at least with one more request, and at least one additional applicant chooses to participate in the application portfolio, open the first applicant. Additional applicant may choose the amount of time that is currently not used by another application or application for the replacement of the existing applicant in the same period of time.

According to some versions of the implementation of the proposal on the possession of goods, beginning with a specific future date, may also be replaced with the proposal application of higher rates, if the seller allows a replacement. According to other variant of implementation available to the seller, the buyer can bid on the possession of goods to certain dates or for the period of time that is associated with a certain event (for example within 5 days after another of the applicant). Thus, for example, the applicant offering the highest price, can get the goods on x1 days, following the applicant offering the highest price, can get the goods in 2 days, etc.

At the stage 306 aggregation unit 204 aggregates applications to the product portfolio in the application. Portfolio application may contain applications, offering the highest prices uncompetitive periods of time, and an application offering the highest price, on the possession of goods, beginning with a specific future date. At the stage 308 processing unit 208 determines the winning portfolio proposal, among other portfolio of proposals and on the stage 310 awards unit 206 awards goods winning portfolio proposal.

Figure 4 shows a block diagram of the method 400 combinatorial portfolio aggregation in e-Commerce according to one implementation variant. Method 400 can be made of the processing logic that may contain hardware (such as a dedicated logic, programmable logic, microcode etc), software (which is executed by a computer system General purpose or dedicated machine), or a combination of both. According to one variant of realization of the processing logic is constantly in the car 200 e-Commerce, shown in figure 2. Method 400 can be implemented using various blocks described above with reference to Figure 2. Each of these blocks can contain processing logic.

Method 400 begins at the stage 402 where the seller sends the goods for sale using one of the user interfaces 120 shown in figure 1. According to some versions of the implementation of the seller can set the condition for sale at the price offered by a single application, or application portfolio, higher than the set published reserve price. The publication of the reserve price perform on stage 404. As shown in step 404, publication reserve price is the option. If the reserve price is not published, it cannot be seen by the applicants. Sold on your preference may publish or not to publish the reserve price. For example, the seller may specify that it reserves the right to cancel the sale if the price of a single or/and portfolio applications submitted within 10 days, less than 100 USD. At the stage 406 publish the deadline sale.

At the stage 408 receiving unit 202 200 machines for electronic Commerce accepts the application for the goods. If the applicant proposes price, and its application is an application for the right of ownership, the applicant may specify some criteria for the process of portfolio bid, if specified criteria are permitted by the seller. For example, the applicant, who have formed their own portfolio, may specify the minimum amount of the application. For example, the buyer can specify that a minimum amount of applications is 2 USD. This approach can then save to the buyer a certain amount of time due to the exclusion of applications that do not meet the set criteria. After other applicants will join the portfolio, the applicant of the right of ownership cannot be replaced. Another applicant, the offering price for the ownership of the goods will have to open a separate application for right of ownership in a different portfolio. On the other hand, if the first applicant is not the applicant for the right of ownership, the new applicant bidding to be the applicant for the right of ownership, and can set some criteria (authorized by the seller), which must be met in order to join this portfolio. The seller when you publish the list of goods for sale has the right to decide whether to be replaced by the applicant of the right of ownership.

At the stage 410 processing unit 208 specifies whether the order price equal published reserve price or more. According to some versions of the implementation of the application filed within the specified period of bidding completion, is the winning bid, if no portfolio or portfelnaja applications with higher rates. When the processing unit 208 determines that the application of equal published reserve price or more, the management method 400 passed the stage 420, which determine achieved if the period of bid closing. If the expiry date of the auction not reached that stage 408 400 way continue to accept applications. Otherwise, if the period of bidding completion is reached, the management method 400 passed the stage 422, on which the award unit 206 selects the winning bid.

If it is determined that the price of the bid exceeds the reserve price, and the applicant does not wish that the applicants had acceded to his request, the management method is passed the stage 420. Other applicants may accede to this demand and to further increase the total amount of the application. Thus, if at the stage 410 determined that the order price is less than the reserve price, the management method 400 passed the stage 412, which handles block 208 determines whether such application is an application for possession of goods, starting at the specified time.

If at the stage 412 determined that this proposal is an application for possession of goods, control of the way 400 passed the stage 416, through processing unit 208 determine whether other applications aggregated with this application portfolio in the application. The applicant can explicitly specify that his application cannot be aggregated. In this case, the control method is passed the stage 420, which determine achieved if the period of bid closing. If it is determined that the deadline the deadline is reached, the management method 400 passed the stage 422, which determine the winning bid in the tender process.

On the other hand, if the stage 412 determined that the application is not a claim of ownership, management method 400 passed decisive step 414, which determine whether the buyer to join the existing portfolio application. If the buyer wishes to join an existing application portfolio, current bid is placed in the environment portfolio of the application in which it competes for a specific period of time.

According to some versions of the exercise of the applicant may attach to the portfolio the proposal the proposal offering the lowest price for the desired period of time among other applications for this portfolio. The applicant may submit a trusted application (proxy bid) at the desired period of time, indicating the maximum price that you are prepared to pay. If it is determined that the applicant wishes to join the existing portfolio the application, the current proposal include in an existing application portfolio, and management method 400 passed the stage 422, which determine the winning bid.

According to some versions of the implementation of losing the applicant participating in the portfolio application with low price, may request accession to the winning portfolio application by passing its request the seller or the applicant offering the highest price in the winning portfolio, if there is no conflict of interest with the current applicants. Losing the applicant can also open a new portfolio to provide the best opportunities to be on the winning team.

If at the stage 412 determined that the applicant wishes to apply for ownership of the goods, at the stage 416 specified the applicant decides whether he prefers to aggregate their application with other applications in the existing portfolio application. According to some versions of the exercise of the applicant may withdraw from joining any existing portfolio applications, despite the fact that the bid price which is less than the reserve price. At the completion of the auction the seller makes the goods specified applicant, if there are no bids, offering a higher price. However, if the applicant allows other applications to be aggregated with its application, the management method is passed the stage 418.

At the stage 418 aggregation unit 204 aggregates applications, offering the highest prices, at the appropriate uncompetitive ownership in portfolio application. At the stage 420 processing unit 208 decides achieved if the period of bid closing. If you decide that the deadline the deadline is reached, the management method navigates to the selection of the winning proposal between portfolio and portfelnymi applications. According to some variants of implementation before selecting the winning application, the applicant of the right of ownership or sold a portfolio of applications can eliminate at least one of the applications, if the price of portfolio bid exceeds the published reserve price.

According to some versions of the implementation of the seller might exclude for at least one applicant, if published reserve price is not met, and continue the execution of transactions with the rest of the applicants. For example, the seller may exclude an applicant applying for a possession, and then be leased goods remaining applicants according hosted applications. After all periods of lease right of ownership of the goods are returned to the seller. On the other hand, if it is determined that the deadline for the auction not reached, a management method returns to the stage 408, which take additional application. It should be noted that according to some versions of the implementation of the reserve price is not published. If the seller elects not to publish the reserve price, the applicant of the right of ownership may only exclude other applicants after their portfolio will win the auction.

After selecting the winning portfolio claims ownership of the goods may be transferred from the seller to the first chronological owner for a specified period of time. Each subsequent owner (if there are at least two) may be appointed responsible for the following transfers the next chronological owner until the goods are to be returned to the seller or transmitted to end-owner. Special reports of each such transfer of the goods can be agreed with the buyer, for example, during a request. In these special messages can be explained in detail, for example, responsibility of the parties for the transportation charges and responsibility of the parties in the case, if the goods do not reach their destination. In addition, product images can be posted on the web site for evidence that the product is essentially in the same state in which he passed to the next applicant.

Figure 5 shows a block diagram of the method 500 combinatorial portfolio aggregation in e-Commerce according to one implementation variant. Method 500 can be made of the processing logic that may contain hardware (for example, a dedicated logic, programmable logic, firmware, etc), software (which may be executed by a computer system General purpose or dedicated machine), or a combination of both. According to one variant of realization of the processing logic resides in the car 200 e-Commerce, shown in figure 2. Method 500 can be implemented in various blocks described above with reference to Figure 2. Each of these blocks can contain processing logic.

Method 500 begins at the stage 502, on which the receiving unit 206 takes portfolio application. As described above, for the formation of portfolio of an application to aggregate into a single application, other applications, offering the highest prices, at the appropriate uncompetitive possession of the goods and application for possession of goods. At the stage 504 through processing unit 208 determine achieved if the reserve price is published by the seller. If it is determined that the reserve price is reached, at the stage 518 applicant of the right of ownership to eliminate at least one of the applicants. On the other hand, if it is determined that the reserve price is not met, the seller on the stage 506 decides to award or not to award the product portfolio application. If the seller decides not to award the goods, at the stage 508 auction ends without a winner.

On the other hand, if the seller decides to award the goods, at the stage 510 he can optionally exclude at least one applicant. At the stage 512 determine whether or not exclude the applicant offering the highest price. If it is determined that excluded the applicant offering the highest price, at the stage 514 sold awards goods remaining applicants according to their respective applications. After the expiry of all lease terms at the stage 516 seller takes possession of the goods, if all applicants ownership rights were excluded in the process of bidding. Otherwise, the goods are passed to the applicant by the right of ownership, which offered the highest price. According to some versions of the implementation of the seller may wish not to return the goods themselves, but instead to sell the specified goods to the applicant, selected from members of portfolio applications. If at the stage 512 applicant offering the highest price, it is not excluded that at the stage 520 portfolio application this award to the applicant offering the highest price, and the applicant offering the highest price, at the stage 522 carries out a transaction with the other applicants winning portfolio of the application. At the stage 518 the applicant offering the highest price, can optionally exclude at least one of the applicants, the absence of which in the portfolio of the application according to him will help him to remain competitive. Upon completion of all transactions on stage 524 the applicant offering the highest price, takes possession of the goods. According to some versions of the exercise of the applicant offering the highest price, may lose their right of ownership in favor of following the applicant offering the highest price. Following the applicant offering the highest price, as may assign ownership of the next applicant offering the highest price, and so on until the last of the applicant.

On 6 shows a block diagram of the way 600 combinatorial portfolio aggregation in e-Commerce according to one implementation variant. The way 600 can be made of the processing logic that may contain hardware (for example, a dedicated logic, programmable logic, firmware, etc), software (which is executed by a computer system General purpose or dedicated machine), or a combination of both. According to one variant of realization of the processing logic is constantly in the car 200 e-Commerce, shown in figure 2. The way 600 can be implemented in various blocks described above with reference to Figure 2. Each of these blocks can contain processing logic.

The way 600 begins at the stage 602 where the seller sends the goods for sale. At the stage 604 sold publishes the end of the auction for sale of this product. The expiry date of the auction may specify the date, which shall be determined the winner. At the stage 606 buyer submits its proposal about renting a particular product or possession of specific goods. The proposal may be submitted in the same trading platform that proposal, announced by the seller. At the stage 608 buyer shall publish the specified period is the deadline for proposals. The specified expiry date of the auction is the date until which must be accepted the proposal. At the stage 610 offer of the seller automatically agreed with the proposal of the buyer. According to some versions of the implementation of the buyer and/or seller can agree on their suggestions manually. At the stage 612 seller accepts one or two additional proposals and aggregates them. According to some versions of the implementation of the seller may use the application, the aggregate in the previous iteration, and re-aggregate the previous application with new applications.

At the stage 614 determine made whether the deadline specified by the seller. If it is determined that this deadline the deadline is reached, at the stage 616 seller decides to do or not to do the transaction applicants related to the aggregated application. If the seller decides to execute a transaction at a stage 620 it awards the goods winning aggregated application. Otherwise, if the seller decides not to carry out the transaction, the management method is passed the stage 618, which determine whether or not expired deadline associated with the offer of the buyer. If the specified term the deadline has not expired, the seller may re-list the item for sale and to re-enter the buyer's request, in aggregated form.

7 shows the block diagram of the way 700 combinatorial portfolio aggregation in e-Commerce according to one implementation variant. The way 700 can be made of the processing logic that may contain hardware (for example, a dedicated logic, programmable logic, firmware, etc), software (which may be executed by a computer system General purpose or dedicated machine), or a combination of both. According to one variant of realization of the processing logic resides in the car 200 e-Commerce, shown in figure 2. The way 700 can be implemented in various blocks described above with reference to Figure 2. Each of these blocks can contain processing logic.

The way 700 begins at the stage 702 where the seller sends the goods for sale. At the stage 704 sold publishes the end of the auction for sale. At the stage 706 buyer submits its proposal on the possession of goods. The buyer may not specify a deadline for the end of bidding by their proposal. At the stage 708 offer buyer automatically negotiate with the goods offered for sale by the seller. At the stage 710 determine whether the maximum bid price is less than the limit price from the seller. If the marginal buyer's price is less than the marginal rates of the seller, the seller may reduce its price. At the stage 712 determine whether the seller reduced the price. If the seller reduced the price, control the way 700 return to the stage 710 to determine whether the purchaser's price is still less than the price of the seller. If at the stage 710 determined that the bid price not less than the prices of the seller, the management method is passed the stage 714, which determine whether the expiry of the period of bid closing. If the expiry date of the bidding expired on stage 718 transaction. If the seller at the stage 712 not lowered the price, control the way 700 passed the stage 714.

At the stage 714 processing unit 208 determines whether expired deadline specified by seller. If the period of bidding completion, the management method 700 passed the stage 716. At the stage 716 processing unit 208 determines whether the seller is willing to undertake the transaction, despite the fact that the bid price below the price of the seller. If the seller wishes to execute a transaction at a stage 718 transaction. Otherwise, the management method 700 starts 706, on which the buyer reiterates its proposal.

For example, a computer system contains 800 processor or different processors 802 (such as the Central processing unit (CPU), the graphics processing unit (GPU), or both), RAM 808 and static memory 814, which are connected with each other by bus 828. Computer system 800 optionally contains the video display 806 (such as liquid crystal display (LCD)). Computer system 800 can also contain alphanumeric device 812 for input (such as a keyboard), the device 816 cursor control (such as a mouse, disk drive, 816, device 826 to generate a signal (such as a speaker) and network interface device 818.

Disk drive 820 contains machine-Readable medium 822, which saved at least one of the sets of instructions and data structures (such as instructions 810)implementing at least one method or one of the functions or used at least one method or one of the functions described in this application. Instructions 810 also can completely or at least partially to reside in RAM 808 and/or processors 802 during their performance of the computer system 800. RAM 808 and processors 802 can also generate machine-readable media.

Instructions 810 additionally can be transmitted or received via the network 824 using a network interface unit 818, using any of a variety of known protocols (such as the hypertext transport Protocol (HTTP)).

Though the machine-Readable medium 822 in this implementation is shown as a single carrier, the term "machine-Readable carrier" should be understood as consisting of a single media or multiple media versions (e.g centralized or a distributed database and/or related caches and servers), which is saved at least one of the sets of instructions. The term "machine-Readable carrier" should be understood as including any medium made with the possibility of storage, coding or transfer set of instructions for execution machine that cause the machine to implement at least one of the ways described in this application, or made with the possibility of storing, coding, or transfer of the data structures used or associated with the specified instruction set. The term "machine-Readable medium" respectively shall be construed as including, but not limited to blocks of solid state memory, optical and magnetic storage media, as well as carrying wave signals. Such media can also contain among other things the hard disks, floppy disks, cards, flash memory, disks to record digital video memory with arbitrary sample (RAM), permanent memory (ROM), etc.

Indicative options for implementation described in this application, can be carried out in the operating environment that contains the software installed on the computer, hardware, or using a combination of software and hardware.

Figure 9 shows the first part of the block diagram method 900 combinatorial portfolio aggregation in electronic Commerce, which uses all pipeline proposals, according to one implementation variant. As shown in Figure 9, the way 900 begins at the stage 902 where the seller sends the goods for sale. Optional attributes, such as completion date of the auction, the reserve price and the minimum price of bids, may be associated with the goods. For example, the seller may sell the goods within 10 days with the reserve price of $ 100 and the minimum order price to 1 US dollar. For sale may be exhibited various goods.

After the start of trading on stage 904 buyers post applications individually or in the specific portfolio applications. According to some versions of the implementation of the applications can be posted automatically if the applicant or group of applicants decided to join the pipeline of similar goods, and met other trading criteria. At the stage 906 for each application to determine whether such application criterion of the minimum amount of the claim. If the application does not meet the criterion of the minimum sum of the application at the stage 908 mentioned application is rejected. If the application is rejected, on the stage 924 individual applicant or the leader of the offering price of the group decide to join them on the conveyor of such goods, as shown in Figure 10.

Otherwise, if the stage 906 criterion minimum amount of the claim is satisfied, on the stage 910 aggregate portfolio request of the buyer. After receiving requests from bidding applicants, at the stage 912 determine whether the price offered aggregated application, still below the reserve price. If the price of the aggregated application is still below the reserve price, at the stage 914 seller decides to cancel or not to cancel the auction. If at the stage 914 seller decides to cancel an auction on stage 902 he again puts on the sale of the specified goods (or different goods). Otherwise, if the seller decides not to cancel the auction even though the criterion reserve price is not met, at the stage 916 he decides to cut or not to cut the reserve price. If the seller does not reduce the reserve price, the management method 900 starts 902, on which the goods are re-sale. According to other variant of the invention, the seller may decide to lower the reserve price for the aggregate applications to achieve the minimum reserve price, and controlling how passes to the stage 910.

In the example above, in which the seller selling the goods within 10 days with the reserve price of $ 100 and the minimum order price to 1 US dollar, the first Complainant offers 50 US dollars for the ownership of the goods. The second Complainant offers 20 US dollars for the lease of goods within 2 days. The third Complainant offers 5 US dollars for the lease of the goods within 5 days. The fourth Complainant offers 5 US dollars for the lease of goods within 2 days. Fifth, the applicant proposes to 1 US dollar for the lease of goods within 8 days. Sixth, the Complainant offers 0,5 USD for the lease of goods within 8 days. The sixth applicant is refused because the price of his bid below the minimum rates 1 US dollar. In response to the sixth applicant joins the pipeline of similar goods. Since the total sum of the aggregate of the bid is USD 81 below unpublished reserve price of USD 100, the seller may cancel the tender or dynamically reduce the reserve price to value is less than USD 81 (e.g. 80 USD).

Figure 10 shows the second part of the block diagram method 900 combinatorial portfolio aggregation in electronic Commerce, which uses all pipeline proposals, according to one implementation variant. As shown in Figure 10, the buyer or group of buyers, whose applications are rejected at the stage 908, shown in Figure 9, at the stage 924 decide to join or not to join the pipeline of similar goods. Besides, at the stage 922 to the pipeline of similar goods can join and new applications that have not been rejected.

At the stage 926 determine whether the seller or the applicant for the right of ownership open bidding for conveyor applicants. If at the stage 926 determined that the auction for other applicants/groups are open, and at the stage 928 determined that the applicant meets the other requirements specified by the seller or by the applicant for the right of ownership, at the stage 930 applicant or group leader of the applicants asked to confirm and to attach to this application portfolio. If the buyer or the applicant offering the highest price, satisfy the requirements and confirm joining the portfolio, at the stage 932 their application is registered automatically.

Thus, the proposal may be agreed with the goods on the basis of data relating to this proposal and characteristics of the product and the criteria for the transfer of goods. Based on the results of this agreement, the proposals selectively aggregated at the portfolio application. It should be noted that all pipeline proposals can be generated individual seller/buyer or group of sellers/buyers. According to some versions of the exercise of the applicant can choose the degree of similarity between the goods in the pipeline, which it wishes to receive.

For example, the sixth applicant mentioned above with reference to Figure 9, was rejected because his application did not meet the requirement of a minimum bid price of 1 dollar. The sixth applicant may join the pipeline of similar goods, which does not claim to applications requirements minimum rates. After verification of compliance with the requirements of the buyer acknowledges that he can join another portfolio automatically. Example requirements may include the decision of the seller or the applicant's right of ownership of information about opening of trades for applicants in the pipeline without applicants that are first shall apply. In addition, the applicant may be required to confirm and to attach to the portfolio. Thus, the pipeline is a pool of open applications. Because the seller can sell various goods, the sixth applicant can become a member of various portfolio of applications, if there is no requirement minimum price of bids. According to some versions of the implementation of the seller may reduce the price separately for each portfolio applications. In addition, the seller may sell the same goods without selling price in the format of "open market".

Figure 11 shows the block diagram of the ways 1000 and 1100 create groups of buyers and sellers under one implementation variant. Method 1000 begins at the stage 1002, on which the buyer creates equity group to the proposal from bidding in the auction or participate in the pipeline. At the stage 1004 buyer, who is the leader of the group, offers a price in accordance with the bidding rules for aggregate claims. If at the stage 1006 determined that the group leader has won the tenders on stage 1008 group shares participation in possession of the goods on the basis of individual applications under the General rules of the auction. Otherwise, if the stage 1006 determined that the leader of the group of buyers has not won the tenders on stage 1010 group joins the pipeline. If the leader of the group won the auction, but is not the applicant for the right of ownership, it must transfer the goods from the group to the next applicant offering the highest price, in this portfolio application. According to some versions of the implementation of the leader of the group may have a member in the group, which last owns the product to perform the transfer.

However, if the buyer creates its own private group for the equity in the purchased goods or already in the possession, the buyer may sell such goods and allow other claimants to file applications for the specified goods within this private group. Other buyers can bid on receipt of the goods according to the rules applied to the rest of the community. However, the price offer is open only to members of the group. As shown in the block diagram of the way 1100, sellers can also create your own group of buyers and/or sellers. Thus, the way 1100 begins at the stage 1102, which sold forms a group of buyers. At the stage 1104 other sellers join the group for the joint sale of their products.

On Fig shows the block diagram of the way 1200 combinatorial portfolio aggregation in electronic Commerce, which uses escrow, according to one implementation variant. The way 1200 begins at the stage 1202, where portfolio buyers pay for the goods, which they won. At the stage 1204 determine whether escrow. Escrow can be used to guarantee the transfer of goods from one portfolio of the applicant to another and final transfer of the goods back to the owner. If at the stage 1204 determined that the required escrow, portfolio buyers undertake to Finance the specified escrow. According to some versions of the implementation of the escrow must be paid by all customers before making the first transmission, with the escrow funds are released after the transfer of goods to the owner. If an applicant violates the payments relating to an application or escrow, the applicant may be omitted, and notify the next of the applicant. Violations can be written in the reputation profile of the applicant, and such facts can be notified whole chain of applicants.

According to other variants of realization of the escrow must be paid by each buyer before the goods are transferred this to the buyer and the escrow funds shall be released after confirming the transfer of the goods to the next buyer. In the event of any payment relating to an application or escrow violated the applicant may be omitted, and notified the next applicant. Violations can be written in the reputation profile of the applicant, and such facts can be notified whole chain of applicants. Thus, at the stage 1206 determine, do all buyers participating in this portfolio, Fund escrow before the first transfer of the goods. If at the stage 1206 determined that all buyers are obliged to Fund the escrow, controlling how 1200 passed the stage 1208, in which all buyers, with the exception of the buyer applying for the right of ownership, Finance escrow. At the stage 1210 the goods are passed to the first buyer, and at the stage 1212 the goods passed from the initial purchaser second buyer. Transmission continues until the stage 1214 last buyer shall not deliver the goods to the buyer the ownership. If the process goes from stage 1208, the escrow funds may be returned to the applicants once the owner accepts the goods.

For example, the seller or the community for this portfolio may require escrow amount is equal to the amount paid for the goods (100% or a percentage, specified by the auction winner for the right to ownership), to ensure that everyone in the chain will receive the goods. Thus, if $ 2 as escrow must be paid at the beginning, the purchaser, who offered US $ 2 for the right to have the goods within 2 days, must pay $ 2 in the beginning. 2 USD will be refunded to the buyer once the latter occurs transfer. On the other hand, if escrow is payable in stages, each buyer should pay 100% or a percentage, determined the winner-the owner of the total amount (e.g. $ 80) to the transfer of the goods. According to some versions of the implementation of the seller or the applicant for the right of ownership may place the goods in an infinite loop. The goods can be passed to the next person for an indefinite period of time before filing the application to the next gear.

On Fig shows the block diagram of the way 1300 demonstration of the goods according to one implementation variant. The way 1300 begins at the stage 1302, on which the seller chooses the original period of time after which the goods are sent to the first buyer. Then, at the stage 1304 seller specifies the maximum total demo period. At the stage 1308 seller specifies the number of displayed products. At the stage 1310 sold at the auction without specifying the minimum amount for applications or escrow. At the stage 1312 buyer offers a price for the goods. The application may be monetary or non-monetary. At the stage 1316 goods sent after the original period of time to the first applicant. At the stage 1318 representative of the buyer fills the report, and on the stage 1320 goods from the last applicant's return to the seller or to the applicant for the right of ownership.

Thus, the seller may sell the goods for a "demonstration" in the form of equity participation in a given commodity in exchange for the report and / or to sell the goods to the applicant offering the highest price. For example, the seller can "demonstrate" the goods within 100 days, 10 days for each applicant. The initial period can be set in 20 days after the start of the demonstration. Goods must be returned after 100 days to the original owner or to the applicant offering the highest price. In the format of the open market can be demonstrated various goods without the requirement of a minimum price for application and/or escrow. Applicants who do not make the payments may be asked to fill out a report after possession of the goods. The report may contain, for example, age, geographic location, the period of use in place and reputation. The report can be made for example in the form of short answer and telephone surveys.

On Fig shows the block diagram of the way 1400 combinatorial portfolio aggregation in e-Commerce using Docker of the applicant according to one implementation variant. The way 1400 begins at the stage 1402, where the seller sends the goods for sale. The seller may decide to have Docker of the applicant in this portfolio group if none of the other applicants has bid for the right to possession of the goods, or if the right of ownership is not allowed at all. The seller may specify the criteria for the applicant, who wants to be Docker by the applicant.

At the stage 1404 sold as an option can set a reserve price, which may or may not be published. If the seller has decided to publish the reserve price at the stage 1406 publish the reserve price. At the stage 1408 publish the dates of the deadline established for this transaction. After the expiry of the deadline applications will not be accepted. At the stage 1410 specify other requirements for the process of bidding. Requirements may include a minimum rates for proposals and the need to inform or be taken into account during the reception of applications of information related to the reputation of prospective applicants. Other requirements may include or not to include the need escrow for the transaction, and in case of such necessity, terms and order of financing of the specified escrow. Other requirements may include rights Docker of the applicant, which define the procedure of transfer of goods from the portfolio of the application in case of absence of the applicants for the right of ownership or the order to restore the rights of ownership to the seller. Other requirements may be specified in the order request on the right of ownership. You should understand that at the stage 1402 can be set to any other criteria pertaining to the transaction that are not limited to the above as an example requirements.

Otherwise, if the stage 1418 determined that this proposal is not a request for a right of ownership, controlling how 1400 starts 1420, which determine whether the applicant to join, at least, to one of the other portfolio of applications. If the applicant wishes to join another portfolio of the application at the stage 1424 his application aggregate with other applications for the corresponding non-competitive ownership in one of the portfolio of applications. If at the stage 1422 the applicant of the right of ownership decides that other applicants cannot accede to his request, controlling how 1400 passed the stage 1428, which determine achieved if the period of bidding completion, published on stage 1408. If the expiry date of the auction not reached, a management method 1400 starts 1416, which continue to accept applications. If at the stage 1420 determined that the applicant is not applying for the right of ownership does not wish to join any of the existing portfolio of applications, controlling how 1400 starts 1426, which determine whether the applicant to be Docker by the applicant (for the ownership of the goods until such time as ownership will not be transferred to another individual or portfolio to the applicant). If the applicant wishes to be Docker by the applicant, controlling how 1400 starts 1428, which determines there any deadline for the transaction. If the applicant does not wish to be Docker by the applicant, controlling how 1400 starts 1428. After reaching the end of the auction management method 1400 starts 1430, as shown in Fig.

Upon expiry of the deadline, as shown in Fig, at the stage 1430 determine whether the amount of portfolio application reserve price. If the sum of portfolio applications more reserve price, controlling how 1400 starts 1436, which selects the winning bid (or portfolio or portfelnuju). If the sum of portfolio application does not exceed the reserve price at the stage 1432 seller rejects the order or on the stage 1434 reduces the reserve price so that a new reserve price was less than the sum of portfolio applications. After this management method 1400 starts 1436, which select the winning bid.

At the stage 1438 determine whether the winning application contains a claim for the right of ownership. If you have an application on the right of ownership, the transaction can be completed once at the stage 1440 remove the selected applicants. Otherwise, if there are no applicants for the right of ownership, at the stage 1442 determine whether the right of possession of the goods back to the seller. If the right of ownership must be returned to the seller at the stage 1444 the goods back to the seller after the transaction is complete. Otherwise, if the seller does not wish that the goods were returned on stage 1450 last the applicant, who will own the goods, receives the right of ownership of the goods. According to other variant of the invention at the stage 1446 Docker-the applicant if the application Docker-the applicant has in winning portfolio, is entitled to possession of the goods to transfer this product to another applicant from another portfolio (or single reportfilename the applicant) or for a specified period of time. Otherwise, if the stage 1448 determined that the application Docker of the applicant in this portfolio are not available, during 1444 the goods back to the seller after the transaction is complete.

On Fig shows the block diagram of the way 1600 combinatorial portfolio aggregation in electronic Commerce, which uses Docker-the applicant, according to one implementation variant. The way 1600 begins at the stage 1602, where the seller sends the goods for sale. At the stage 1604 sold optionally sets the reserve price, which may be published or not published. At the stage 1606 published deadline the deadline specified for the transaction. After the expiry of the deadline applications will not be accepted. At the stage 1608 specify other requirements for the application process. These requirements may include a minimum rates for proposals and the need to inform or be taken into account during the reception of applications of information related to the reputation of prospective applicants. Other requirements may include or not to include the need escrow for the transaction, and in case of such necessity, terms and order of financing of the specified escrow. Other requirements may include rights Docker of the applicant, which define the procedure of transfer of goods from the portfolio of the application in case of absence of the applicants for the right of ownership or the order to restore the rights of ownership to the seller. Other requirements may be specified in the order request on the right of ownership. It should be understood that other criteria relevant to the transaction, is not limited to the above as an example requirements.

Controlling how 1600 can be transferred optional step 1610, on which the seller sets the value of the request. The seller may specify the minimum amount of the application of zero, as shown in step 1610. The optional stage 1612 the seller establishes the rights Docker-applicant on the basis of criteria according to which the applicant who wishes to apply for the right of ownership are permitted to own a traded commodity certain period of time or until such time as the goods will not pass to another applicant. After specifying the requirements and criteria for the bidding controlling how 1600 starts 1614, which begin to accept applications. After each accepted application management method 1600 starts 1616, which determine achieved if the period of bidding completion, published on stage 1606. If the expiry date of the auction not reached, a management method 1600 returns to the stage 1614, which continue to accept applications. If at the stage 1616 determined that the deadline the deadline is reached, the management method 1600 starts 1618, on which the applications received at the stage 1614, aggregated with other applications for the corresponding non-competitive ownership in portfolio application.

At the stage 1620 determine whether the application cash value. If at least one application has cash value, at the stage 1622 establish procedures for the receipt of goods by the applicants according to the cash value or their corresponding applications. At the stage 1624 rank according to the established order, all monetary and non-monetary applications, and applications with a higher monetary value, have the advantage of receiving the goods before the non-monetary claims (which are ranked according to the principle "first application is the first in the list"), and begin a transaction. At the stage 1626 end the transaction, when the last of the applicant (not necessarily portfolio applicant accepts the goods. The last applicant who goods, may be by default assigned Docker by the applicant owns the goods until the goods will not pass to the next applicant. At the stage 1628 Docker-the Complainant owns the goods specified period of time, until the item is automatically again put up for sale after a specified period of time. According to some versions of the implementation phase 1630 the seller may use the option of return of the goods from the Docker of the applicant.

On Fig shows the block diagram of the way 1700 combinatorial portfolio aggregation using electronic devices containing various front-end devices, according to one implementation variant. Applicants can bid with use of various forms of user interface devices. The speed dial keys to facilitate the entry of the application, at least one key, or word. The way 1700 begins at the stage 1702, on which the customer starts the application process. To request on stage 1704, the buyer has the ability to set filters for applications or preferences. For example, the buyer may wish to first view the goods placed sellers in his friends. At the stage 1706 buyer specifies the desired amount of bids for goods available for bidding. At the stage of 1708 the buyer specifies the period during which it is desirable selling product is on sale at the stage 1710 buyer searches for the desired product on the basis of the above parameters.

At the stage 1712 determine whether the available desirable goods. If the desired item is not found, at the stage 1710 buyer repeats the search. Otherwise, if the goods are found, and the application is hosted by a non-mobile device (as defined in the stage 1714), controlling how 1700 starts 1718, which can determine whether to use preferences for non-mobile device. If it is determined that preferences can be used at the stage 1722 use short codes for quick one-touch input or filing the request. At the stage 1728 transaction.

If the buyer uses a mobile device (as defined in the stage 1716), controlling how 1700 starts 1720, which can determine whether to use the preferences associated with your mobile device. If it is determined that these preferences can be used at the stage 1724 place your request through the use of text codes to quickly add or one-touch application. Then on the stage 1728 transaction. Otherwise, if at stages 1718 or 1720 determined that the specified preferences may not be used, controlling how 1700 starts 1726 on which the user manually enters the application and time. Then control the way you 1700 starts 1732, shown in Fig.

On Fig shows the block diagram of the way 1700 combinatorial portfolio aggregation in e-Commerce using Docker of the applicant according to one implementation variant. At the stage 1732 end the transaction (announce the completion of the transaction). If at the stage 1734 it is determined that the applicant is a Docker by the applicant at the stage 1736 specified the applicant pays for the right to be Docker by the applicant. At the stage 1738 keep the goods before its transfer as a result of other transactions or for a specified period of time. If at the stage 1740 determined that occurred following the transaction, at the stage 1742 seller pays Docker-the applicant, and on the stage 1744 the goods pass the following portfolio to the application. As shown in step 1746, after the transfer of goods on this application is not subject to any additional obligations. In addition, if the stage 1740 following the transaction does not occur at the stage 1738 goods contained in Docker of the applicant. Similarly, if the stage 1734 determined that the applicant is not Docker by the applicant at the stage 1746 on the applicant is not subject to any additional obligations.

On Fig shows the block diagram of the way 1900 for combinatorial portfolio aggregation in e-Commerce using friendly attributes according to one implementation variant. The way 1900 begins at the stage 1902 after the transaction is complete. At the stage 1904 determine whether a party involved in the transaction, to share their experiences. If the party does not wish to share their experiences on stage 1906 covered party shall be released from any further obligation. Otherwise, if the party wishes to share its experience on stage 1908 covered party publishes the current report or clarifies reports ratings. If at the stage of 1910 determined that this report can be used to create a profile to log into pipelines, at the stage 1912 create a profile that at the stage of 1918 contributes to the advanced search of goods for the individual applicant. If at the stage of 1910 determined that the reports should not be used to create a profile to log into pipelines, at the stage 1906 covered party shall be released from any further obligation.

At the stage 1914 can determine whether the reports to be published. If reports can be published, at the stage of 1920 these reports tie links to groups associated with the Complainant, who presented the report, and on the stage 1922 this information in aggregate with other data related to the performance of the group, which subsequently leads to improvement of the search for goods on the stage 1918. If the report cannot be published, at the stage of 1916 the information made available to friends, but leave anonymous its relationship with the user groups. The applicant may be associated friends, so they can be the first informed about the ratings of their friends and comments, in addition to public ratings. This can provide a deeper level of awareness for the applicant, decision-making about placing an order and the sum of the application. Searches can be made on the basis of the opinions of friends, description of the goods or the identity of the goods. After the information is aggregated on the basis of the individual reports, providing advanced search of goods, controlling how 1900 starts 1924, shown in Fig.

On Fig shows the block diagram of the way 1900 combinatorial portfolio aggregation in e-Commerce using friends and various shopping channels, according to one implementation variant. From the stage 1918, shown on the drawing, controlling how 1900 starts 1924, or step 1942. In any case, the method enables customers to record their search information, so they can make the best decision. The difference between 1924 and 1942 is that at the stage 1924 the buyer searches for a product to make direct purchases, while at the stage of 1942 the buyer just looking at the offers available to gather information.

Accordingly, if the management method 1900 goes to the line of phase 1926, buyers at the stage 1926 can group your orders, as may have other users that search for products using the same criteria. On the basis of these groups at the stage 1928 aggregate different levels of demand. Demand can be aggregated on the basis of how much buyers are willing to pay, how long they want to use the goods and any particular item they want to use. Discounts applicable to such aggregate demand may be dependent on the number of buyers, as long buyers want to own the goods, etc.

At this point of the process buyers are not required to form a portfolio of the proposal, they only search for goods on the basis of certain criteria. Thus, at the stage 1928 buyers gather together on the basis of their demand. After studying demand management method 1900 starts 1932, at which the seller decides how he will manage the demand. At the stage of 1934 the seller sells the goods on the basis of the current demand and performs sale in the real-time mode. According to other variant of the invention at the stage 1936 the seller informs the customers that puts the goods on the auction and invites customers to file applications with the offer price of the specified goods.

Besides, at the stage of 1938 the goods put up for sale for a portfolio of applications by allowing users to apply collectively in the form of aggregated application. If the seller wants to give the goods free of charge to encourage, for example, during 1940, the seller may allow buyers to file applications with zero price. Thus, sellers may have several options when managing the demand of the buyer.

If, instead of seeking to immediately purchase, the buyer on the stage 1942 decides to explore the market situation, he may apply to the comments left by his friends. As shown in Fig, buyers can post comments relating to their transactions. Comments can be left anonymous buyers or buyers, announcing their names. The presence of the name associated with the comment you can make the comments more weight, especially if the buyer is collecting the information, connected with the buyer, who left the comment. In addition, the feedback can be private, visible only to some group, for example a group of friends. A way of linking buyers with friends is to join in the portfolio application. Thus, the buyer may be able to save only friendly relations with other buyers that in the past he made deals. Another way partnership with friends is to form groups. Buyers can be partners on the basis of common interest, such as coin collecting, in addition to other ways of forming groups.

At the stage of 1944 the goods, who is wanted by the buyer, is associated with his account and groups. Thus, if the buyer is looking for a specific product, he can see private comments made by his friends. Thus, according to the way 1900 buyers can be associated with a product, instead of link products with customers. If, instead, at the stage of 1956, the buyer sends a request to the other, on stage 1958 this information in aggregate to-read format and at the stage of 1944 shown to the buyer. Depending on whether mobile or non-mobile device uses the buyer when searching, controlling how 1900 switches to the stages of 1946 and 1948 respectively. For example, a potential buyer can get in the supermarket Wal-Mart and get a wireless device to search. After the buyer will take the information, he is on stage 1950 decides. If he decides to make a purchase, controlling how 1900 starts 1926, at which a buyer can associate with other buyers. Otherwise, at the stage 1952 he is still searching. According to other variant of the invention at the stage 1954 buyer submits an application or attached to the conveyor application.

On Fig shows the block diagram of the way 1900 combinatorial portfolio aggregation in electronic Commerce, using various market channels, according to one implementation variant. Sellers may have different channels for sale of goods. They can offer the goods of a single buyer at one price, group of customers at a different price, single buyer on the auction price, or to all customers without a price. Sellers can attract customers by various means such as advertising, headers, links, mobile application or the search results. In each market channel sellers can only provide information or allow buyers to bid and to commit the transaction immediately in advertisements, headers, links, mobile applications or search results. In addition, the sellers can carry out a transaction through redirected links. The cost of using these funds may vary from traditional to the current market value of advertising or on the basis of actual sales. Sellers can apply discounts, group rates or distribute the product for free to attract buyers.

Before a transaction is completed at the stage 1978 determine whether the buyer is registered. If it is determined that the buyer is registered, during 1982 end the transaction. Otherwise, at the stage 1980 register before a transaction is completed at the stage of 1982.

Thus, the above-described methods and systems for combinatorial portfolio aggregation in e-Commerce. Although variants of realization are described with reference to specific examples, it should be evident that in the described variants of implementation can be made various changes and modifications without derogating from the ideas and volume is described in this application systems and methods. Accordingly, the specification and drawings should be considered illustrative, but not in a restrictive sense.

1. Implemented using the computer way of doing e-Commerce, containing phases in which: taken from the applicant, using the processor first data related to the first sentence regarding the ownership, at least one part of the goods on some first time, and the product is connected with properties of the product and the criteria for transfer of the goods; take from at least one other applicant with CPU, main data associated, at least some, second sentence regarding the ownership, at least one part of a product, at least on some of the second period, with the first period and mentioned at least the second time are not the same; automatically map, using a processor, referred to the second sentence with the goods on the basis of the first data associated with the first proposal regarding the ownership of goods, properties of the product and the criteria for transfer of the goods; based on the agreement, selectively aggregate, using a processor, first sentence, at least mentioned second sentence of the portfolio in the proposal, at least one part of the goods; automatically determine the utilization of the processor, based on defined criteria, the fact that portfolio proposal is a winning portfolio proposal; process, with using the processor, first data and the second data to generate schedules for temporary ownership of at least one part of the goods in different time periods in accordance with the winning portfolio proposal; carry out, through the CPU, one or more electronic trade transactions between the owner of the goods and one or more applicants related to the winning portfolio proposal; and provide, using the CPU, one or more applicants related to the winning portfolio proposal of at least one part of the goods for a property in the according to the schedule.

2. The method according to claim 1, which further use of all pipeline containing at least one of the applications that were rejected or lost, and the specified queue pipeline proposals consists of several proposals in relation to goods that have the specified image.

3. The method of claim 2, in which the seller associated with the first sentence, uses at least one of the following options in respect of at least one part of the goods: sell, continuous lease, the restoration of property rights after the auction, the reduction in sales price, continuous lease using the dockers and the dismissal of all claims against and restoration of property rights, filed after the auction, if the sales price is not reached, or the seller is willing to share at least in one part of the goods.

4. The method according to claim 3, in which the buyer requires to place referred to the first sentence in turn conveyor sentences after defining the fact that this offer cannot be part of a separate winning portfolio offers.

5. The method according to claim 1, which further implement the resolution, by the processor, suggestions Docker-the applicant with respect to at least one part of the goods in the possession of at least one part of the goods to the other proposals in the absence of proposals for ownership of at least one part of the goods or the prohibition of the right of ownership.

6. The method according to claim 1, which referred to the first sentence place using one of several user interface devices using at least one of the "hot" key, which is the keys quickly add that the applicant specifies in advance and uses when applying.

7. The method according to claim 1, which referred to the first sentence influenced by feedback, at least with one of my friends, which is the information provided at least one of the friends that are at least one of the following: an individual who is currently or previously grouped with the applicant, an individual, who previously or currently involved in a transaction with an applicant, an individual engaged in a business together with the applicant.

8. The method according to claim 1, which referred to the first sentence place using at least one trading channel, containing at least one of the following operating ads: banner, link, mobile application, moving ads, email marketing campaign and search results, and the applicant may submit your application directly to these existing advertisements.

9. Implemented using the computer way of doing e-Commerce, containing phases in which: taken from the applicant, the use of the processor first data associated with the first proposal regarding the ownership, at least one part of the goods for a certain period of time, and the product is connected with properties of the product and the criteria for transfer of the goods; take from at least one other applicant with CPU, main data associated at least with some second sentence regarding the ownership, at least one part of a product, at least, within a one-second period of time, and the said first period of time and at least the second time not coincide; selectively aggregate, using processor referred to the first sentence of at least one mentioned second sentence of the portfolio in the proposal, at least one part of the goods; automatically determine the utilization of the processor, based on defined criteria, the fact that the portfolio proposal is a winning portfolio proposal; automatically determine the utilization of the processor whether the amount of the escrow; require the utilization of the processor, on the basis of the specified definition payment escrow for entry possession of the goods; carry out, using the CPU, one or more electronic trade transactions between the owner of the goods and one or more applicants related to the winning portfolio proposal; and provide, using the CPU, one or more applicants related to the winning portfolio proposal of at least one part of the goods for a property in different periods of time.

10. The method of claim 9, where escrow is paid by every buyer, not applying for the right of ownership associated with portfolio proposal, prior to the first transfer of the goods.

11. The method according to claim 10, which means the escrow is released upon completion of the last transfer of the goods.

12. The method of claim 9, where escrow is paid by every buyer, not applying for the right of ownership associated with portfolio proposal to transfer the goods to the buyer, not applying for the right of ownership.

13. The method of claim 9, which means the escrow is released after confirmation as the buyer of the fact of transfer.

14. The method of claim 9, which further use trading bloc, made with the possibility to provide at least one applicant stimulating codes, which reserve stimulating benefits for some period of time.