Processing

Please wait...

Settings

Settings

Goto Application

1. WO2020109929 - COMPUTER-IMPLEMENTED METHOD, SYSTEM AND COMPUTER PROGRAM PRODUCTS FOR CONTROL AND ALLOCATION OF ACCESS RIGHTS WITH VARIABLE PRICE

Note: Text based on automatic Optical Character Recognition processes. Please use the PDF version for legal matters

[ EN ]

CLAIMS

1. A computer-implemented method for control and allocation of access rights with variable price, wherein a control computing device (100) is used, which includes or has access to a database (101) with information associated with a site comprising one or several sections, each of them with a certain number of places, characterized in that the method comprises:

a) providing, by said control computing device (100), to a bidirectional interface accessible by potential users through computing terminals (10), on a first date, a first offer for at least a first section of said site, including information on a number of places available for said first section, for said first offer, a recommended price and a period of time in which said first offer is valid, wherein the number of places offered in the first offer is less than a total capacity of the site;

b) receiving, by said control computer device (100), through said interface, from said computing terminals (10) of the potential users, and during said period of time, a certain number of proposals with different prices in relation to said first offer;

c) verifying, by the control computing device (100), that the proposals received meet the condition of being greater than or equal to a certain minimum price and:

c1) applying a criterion of allocation of places to those proposals received that meet said condition, and indicate, through said interface, to the computing terminals (10) of the potential users in which their proposal does not meet said condition, that the same is not acceptable, but that they can send another proposal; and

c2) in the event that the number of proposals received that meet said condition reaches or exceeds the number of places in said first offer, the latter will be closed;

d) providing, at the end of said period of the first offer, by said control computing device (100), on a second date, at least one second offer for said at least one first section, including information on the number of places that remain available for said first section, in this second offer, a recommended price, the average closing price of the first offer and a period of time in which said second offer is valid; and

e) repeating steps b) and c) for said second offer and, in case there are still places available in said first section, continue providing other consecutive offers on other dates, for said first section performing steps b) and c) until the number of places for said first section is sold-out,

so that the final price assigned to each potential user reflects a variable maximum price that said potential users are willing to propose.

2. Method according to claim 1 , wherein steps a) to c) are performed for a plurality of sections.

3. Method according to claim 2, wherein in each section of said plurality of sections the minimum price is different.

4. Method according to any of the preceding claims, wherein in step c) if the number of proposals received that meet the condition exceeds the number of places in the first offer, the control computing device (100) automatically:

- expands the number of places in the first section to accommodate the total number of proposals received that meet the condition, said expansion being carried out gradually taking into consideration a rate of reception of the proposals, wherein if the first section does not have more availability, assigns the proposals to at least a second section; or

- expands the number of places in the first section to accommodate the total number of proposals received that meet the condition and if the first section has no more availability, assign the proposals to at least a second section.

5. Method according to claim 1 , wherein the first section is divided into a certain number of blocks, each block having assigned a certain number of places, and wherein the method comprises:

in said step a), providing on said first date, the first offer for a first block of said determined number of blocks, including information about the number of places available in the first block, a recommended price, and a period of time in the which said first offer for the first block is valid;

in step b) receiving, during said period of time, a certain number of proposals with different prices in relation to said first offer for said first block;

in said step c):

applying the criteria for seat allocation to the proposals received that meet the condition and indicate to the users whose proposals do not meet the condition, that its proposals are rejected, but that they can send another proposal, for the first block if it is not closed or for another block; and

in the event that the number of proposals received meeting the condition exceeds the number of places in the first offer, the control computing device (100) automatically expands the number of places in the first block until accommodating the total number of proposals received that fulfill the condition, wherein said expansion is carried out gradually taking into consideration a rate of reception of the proposals, wherein if the first section does not have more availability the control computing device (100) allocates the proposals to at least a second block, so that a dynamic modification of the capacity of the blocks is performed based on the proposals received,

wherein the first block is closed if the number of proposals received that meet the condition reaches, or exceeds, its number of places; and

in step d), providing on said second date, the second offer for said first block if it is not closed or for at least a second block of said determined number of blocks.

6. Method according to the preceding claims, wherein the criterion for assigning places is selected from one of:

priority for those proposals according to their order of reception;

priority for those proposals that have a higher value;

priority for those proposals that are above an average value of all proposals received;

assignment of a certain number of places at a price that exceeds the minimum price of the offer by a predetermined magnitude; or

priority for those proposals that form a group.

7. Method according to the preceding claims, wherein the number of places offered in each offer is the same or different.

8. Method according to the preceding claims, wherein the recommended price of the different offers is the same or different.

9. Method according to the preceding claims, further comprising extending the period of time in which said first offer is valid and / or the period of time in which said second offer is valid for a certain time, until a maximum time, in case of having received a proposal in the 10-15 minutes before the end of said period of time.

10. Method according to the preceding claims, wherein the proposals received from each of the potential users are encrypted, including, each proposal, a unique user identifier with a private key and a public key.

11. Method according to the preceding claims, wherein the method in step c) further comprises:

verifying that the proposals received are greater than a minimum price threshold and/or less than a maximum price threshold, and

applying to those proposals below the minimum price threshold an appreciation that automatically increases the proposal by a certain percentage or applying to those proposals above the maximum price threshold a depreciation that automatically reduces the proposal by a certain percentage .

12. Method according to the preceding claims, wherein the access rights comprise tickets for an event that includes a concert, a theatrical performance or a sporting event, hotel / hostel rooms or tickets for modes of transport including airplane and train.

13. A system for control and allocation of access rights with variable price, the system comprising:

a control computing device (100) that includes one or more processors and at least one memory; and

a database (101) with information associated with a site comprising one or several sections, each of them with a determined number of places and each of the sections including a plurality of places,

wherein the control computing device (100) is adapted and configured to access the database (101) and wherein said one or more processors are adapted and configured to:

a) provide to a bidirectional interface accessible by potential users, on a first date, a first offer for at least a first section of said site, including information about an available number of places for said first section, for said first offer, a recommended price, and a period of time in which said first offer is valid, the number of places offered in the first offer being less than a total capacity of the site;

b) receive, through said interface, from computing terminals (10) of said potential users, and during said period of time, a certain number of proposals with different prices in relation to said first offer;

c) verify that the proposals received meet the condition of being greater than or equal to a certain minimum price and:

c1) apply a criterion of allocation of places to those proposals received that meet said condition, and indicate, through said interface, to said computing terminals (10) of potential users in which their proposal does not meet said condition, that the same is not acceptable, but that they can send another proposal; and

c2) in the event that the number of proposals received that meet said condition reaches the number of places in said first offer, or exceeds it, the latter is closed;

d) provide, upon completion of said period of the first offer, on a second date, at least a second offer for said at least one first section, including information about the number of places that remain available for said first section, in this second offer, a recommended price, the average closing price of the first offer and a period of time in which said second offer is valid; and

e) repeat steps b) and c) for said second offer and in case there are still available places in said first section continue providing other consecutive offers on other dates, for said first section performing steps b) and c) until the number of places for said first section is sold-out,

so that the final price assigned to each potential user reflects a variable maximum price that said potential users are willing to propose.

14. System according to claim 13, wherein said one or more processors are further adapted and configured to perform steps a) to c) for a plurality of sections.

15. System according to claim 14, wherein in each section of said plurality of sections the minimum price is different.

16. System according to claim 13, wherein said one or more processors are further adapted and configured to offer in each offer an equal or different number of places.

17. System according to claim 13, wherein said one or more processors are further adapted and configured to indicate in the different offers an equal or different recommended price.

18. System according to any one of claims 13 to 17, wherein the first section is divided into a certain number of blocks, wherein each block has a number of places assigned.

19. A computer program product comprising non-transient computer executable instructions, the instructions being adapted to run at a computing device, said computing device being able to perform the steps of the method according to any one of claims 1 to 12.