SYSTEM AND METHOD FOR OPTIMIZING UTILIZATION OF A POPULATION OF UNDERUTILIZED PHYSICAL FACILITIES SUCH AS TOURIST FACILITIES

Abstract

Provided is a system for optimizing utilization of a population of underutilized physical facilities and including a time interval splitting controller operative to communicate with some but not all of a plurality of computerized organizations, the time interval splitting controller being configured to perform certain operations when a computerized organization, from among some but not all of the plurality of computerized organizations, seeks to reserve at least one portion of at least one physical facility for a specific time interval, including using a processor for partitioning at least one specific time interval at least twice, thereby to define at least first and second partitions thereof, each partition including a sequence of sub-intervals each having a length which does not exceed the specific time interval's length.

Claims

1.-20. (canceled)

21. A system for optimizing utilization of a population of underutilized physical facilities managed by a corresponding population of facility processors, where utilization is allocated by each individual facility processor responsive to a stream of incoming requests to the individual facility processor from any of a plurality of computerized organizations, each request defining a time interval, each time interval comprising a number of time units and being associated with a value allocated by the facility processor, the system comprising: a time interval splitting controller operative to communicate with some but not all of the plurality of computerized organizations, the time interval splitting controller being configured to at least once perform the following operations when a computerized organization, from among some but not all of the plurality of computerized organizations, seeks to reserve at least one portion of at least one physical facility for a specific time interval: decomposition, comprising using a processor for partitioning the specific time interval at least twice, thereby to define at least first and second partitions thereof, each partition comprising a sequence of sub-intervals each having a length which does not exceed the specific time interval's length; accessing at least one data repository to determine a characterization of each sub-interval comprising a value allocated thereto by at least one facility processor; computing a first value for said first partition by summing values, accessed from said data repository, allocated respectively to sub-intervals defined by said first partition, computing a second value for said second partition by summing values associated respectively with sub-intervals defined by said second partition, identifying an optimal partition from among said at least first and second partitions; the optimal partition comprising, for at least one incoming request, N>1 sub-intervals whose combined length equals said specific time interval, and causing the computerized organization which is associated with the time interval splitting controller to send N requests to the individual facility processor respectively defining said N sub-intervals as the respective requests' time intervals, wherein at least one value summed in said computing operations, is associated with a sub-interval comprising plural time units rather than with each of the plural time units individually.

22. The system according to claim 21, wherein each facility processor comprises a reservation system used by at least one of: a hotel; a Vacation Rental facility; an AirBnb, and a HomeAway.

23. The system according to claim 21, wherein each time unit comprises a day.

24. The system according to claim 21, wherein the computerized organization itself comprises a “middleman” which operates responsive to a stream of incoming requests to utilize physical facilities, originating from any of a plurality of computerized organizations.

25. The system according to claim 21, wherein at least one computerized organization comprises an e-commerce website.

26. The system according to claim 25, wherein said at least one computerized organization comprises an OTA.

27. The system according to claim 21, wherein the computerized organization comprises a wholesaler.

28. The system according to claim 21, wherein the computerized organization comprises a merchant.

29. The system according to claim 21, wherein each facility processor manages a chain, comprising a networked plurality of physical facilities.

30. The system according to claim 21, wherein said portion of a physical facility comprises at least one of: a suite; an apartment and a room.

31. The system according to claim 21, wherein said identifying comprises comparing at least said first and second values to identify as the optimal partition, a partition from among said partitions having a most desirable value using a predetermined ranking of desirability.

32. The system according to claim 21, wherein said identifying an optimal partition comprises using a user-interface to present characterizations of each partition to an end-user, and accepting the end-user's indication of the optimal partition.

33. The system according to claim 21, wherein said physical facility comprises at least one hotel.

34. The system according to claim 22, wherein said reservation system comprises a Property Management System (PMS).

35. The system according to claim 22, wherein said reservation system comprises a Channel Management system (CMS).

36. A computer program product, comprising a non-transitory tangible computer readable medium having computer readable program code embodied therein, said computer readable program code adapted to be executed to implement a method for optimizing utilization of a population of underutilized physical facilities managed by a corresponding population of facility processors, where utilization is allocated by each individual facility processor responsive to a stream of incoming requests to the individual facility processor from any of a plurality of computerized organizations, each request defining a time interval, each time interval comprising a number of time units and being associated with a value allocated by the facility processor, the method comprising: using a time interval splitting controller operative to communicate with some, but not all, of the plurality of computerized organizations, to at least once perform the following operations when a computerized organization, from among some, but not all, of the plurality of computerized organizations, and seeking to reserve at least one portion of at least one physical facility for a specific time interval; decomposition, by partitioning the specific time interval at least twice, thereby to define at least first and second partitions thereof, each partition comprising a sequence of sub-intervals each having a length which does not exceed the specific time interval's length; accessing at least one data repository to determine a characterization of each sub-interval comprising a value allocated thereto by at least one facility processor; computing a first value for said first partition by summing values, accessed from said data repository, allocated respectively to sub-intervals defined by said first partition, computing a second value for said second partition by summing values associated respectively with sub-intervals defined by said second partition, identifying an optimal partition from among said at least first and second partitions, the optimal partition comprising, for at least one incoming request, N>1 sub-intervals whose combined length equals said specific time interval, and causing the computerized organization which is associated with the time interval splitting controller to send N requests to the individual facility processor respectively defining said N sub-intervals as the respective requests' time intervals.

37. The system according to claim 21, wherein the computerized organization comprises a GDS.

38. The system according to claim 21, wherein said accessing comprises, at least once, determining characterizations of a time interval and of a partitioned time interval, both from a single facility.

39. A utilization optimization method comprising: receiving, from a requester, a query seeking to reserve at least a portion of a specific facility managed by a specific facility processor, for a time interval which may be identified by a date and a number of time units; and responsively, in at least one of the following states: said specific facility has no vacant portions during said time interval; and/or said query does not request characterization of said time interval as a whole, decomposing said request, comprising using a processor for at least once partitioning said time interval thereby to define at least one sequence of sub-intervals, and providing characterizations of each of said sub-intervals to said requester.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0092] FIG. 1 is a system, operative in conjunction with one or more sources for data re time sub-intervals such as but not limited to API/s, data repository/ies, data provided by web scraping, Caches, and inventory/ies storing subinterval characterization data which may be pushed such as deals, which uses at least one processor for optimizing utilization of a population of underutilized physical facilities, all constructed and operative in accordance with an embodiment of the present invention.

[0093] FIG. 2 is a system which uses at least one processor for optimizing utilization of a population of underutilized physical facilities, all constructed and operative in accordance with another embodiment of the present invention.

[0094] FIG. 3 is a diagram of plural partitions of a certain time interval into sub-intervals; as shown, each partition includes a sequence of sub-intervals e.g. the last partition includes a sequence of 5 sub-intervals, each being one night long.

[0095] FIG. 4 is a diagram of a Search Process Flow operative in accordance with an embodiment of the present invention.

[0096] FIG. 5 is a diagram of a Booking Process Flow operative in accordance with an embodiment of the present invention.

[0097] FIG. 6 is a simplified flow diagram of a method for optimizing utilization of a population of underutilized physical facilities managed by a corresponding population of facility processors, wherein according to certain embodiments utilization is allocated by each individual facility processor responsive to a stream of incoming requests to the individual facility processor from any of a plurality of computerized organizations, each request defining a time interval, each time interval including a number of time units and being associated with a value allocated by the facility processor. The method of FIG. 6 includes some or all of the illustrated operations, suitably ordered e.g. as shown.

[0098] Methods and systems included in the scope of the present invention may include some (e.g. any suitable subset) or all of the functional blocks shown in the specifically illustrated implementations by way of example, in any suitable order e.g. as shown.

[0099] Computational components described and illustrated herein can be implemented in various forms, for example, as hardware circuits such as but not limited to custom VLSI circuits or gate arrays or programmable hardware devices such as but not limited to FPGAs, or as software program code stored on at least one tangible or intangible computer readable medium and executable by at least one processor, or any suitable combination thereof. A specific functional component may be formed by one particular sequence of software code, or by a plurality of such, which collectively act or behave or act as described herein with reference to the functional component in question. For example, the component may be distributed over several code sequences such as but not limited to objects, procedures, functions, routines and programs and may originate from several computer files which typically operate synergistically.

[0100] Each functionality herein may be implemented in software, firmware, hardware or any combination thereof. Functionality stipulated as being software-implemented may be implemented by an equivalent hardware module and vice-versa.

[0101] Any method described herein is intended to include within the scope of the embodiments of the present invention also any software or computer program performing some or all of the method's operations, including a mobile application, platform or operating system e.g. as stored in a medium, as well as combining the computer program with a hardware device to perform some or all of the operations of the method.

[0102] Data can be stored on one or more tangible or intangible computer readable media stored at one or more different locations, different network nodes or different storage devices at a single node or location.

[0103] It is appreciated that any computer data storage technology, including any type of storage or memory and any type of computer components and recording media that retain digital data used for computing for an interval of time, and any type of information retention technology, may be used to store the various data provided and employed herein. Suitable computer data storage or information retention apparatus may include apparatus which is primary, secondary, tertiary or off-line; which is of any type or level or amount or category of volatility, differentiation, mutability, accessibility, addressability, capacity, performance and energy use; and which is based on any suitable technologies such as semiconductor, magnetic, optical, paper and others.

DETAILED DESCRIPTION OF CERTAIN EMBODIMENTS

[0104] FIG. 1 shows a resource utilisation optimization system 100 in communication with resource providers via modules as shown. Typically, an end user enters a request 106 for a given period. The resource utilization optimization system contacts the providers to determine availability of hotel rooms for the period. Availability of sub-periods may be requested from each of the providers. The combination of sub-periods or days can then be combined to offer the end-user resources (e.g. hotel rooms) for the whole period.

[0105] The system of FIG. 1 typically includes a Date Range Decomposition module (101) which generates a set of splits for the requested date range. The input to module 101 typically includes: arrival date and number of nights, as well as desired characterizations e.g. criteria such as: location, room types, hotel rating (stars). The output of module 101 typically includes a list of permutations of sub-ranges of dates in accordance to the required date range e.g. all possible partitions of an ordered set (array), or all possible tilings of contiguous subsequences in a sequence, or all possible k-partitions of a single dimension array of K elements where k ranges from 1 to K (K may be the number of time units e.g. nights requested to stay at the hotel). For example: given an arrival date of 1 September and a 5 night stay, partitions of the requested date range may include those illustrated in FIG. 3.

[0106] Module 101 need not necessarily generate all possible permutations of date sub ranges, and may instead generate only a portion of the set of all possible splits e.g. using random sampling of the universe of possible partitions or splits or following a policy which determines which possible splits are included in the output of module 101. According to certain embodiments, a date range decomposition policy, which may or may not be end-user selectable, and which determines whether or not to limit to providing an exact coverage of the originally requested date range, or whether to follow a “flexible date range” policy to include a split which when combined covers a total range that:

[0107] (a) begins before or after the stipulated first date or

[0108] (b) ends before or after the stipulated end-date (beginning date plus number of nights).

[0109] The output of the Date Range Decomposition module is forwarded to a sub-interval characterization data Retrieval module 102 which retrieves data characterizing sub-intervals, which may include price quotes, for each of the date ranges in each of the splits generated by the Date Range Decomposition module. The interval characterization data may be provided by from one or multiple external sources such as but not limited to a GDS, OTA, as well as hotel chains, resellers, specific hotels, Hotel Room Booking Deal Inventory (for example roomertravel.com) and/or any other computerized organization that provides on-line interval characterization e.g. price quotes for hotel room bookings. quote requests, for example, may be submitted to computerized organizations (“sources”) using any suitable technology e.g. API, protocol or query predetermined between the parties, or by applying a conventional web scraping technique to a web presence e.g. website of a sub-interval characterization source entity. Interval characterization quotes may also be retrieved from a local or remote cache or database. Any suitable web-scraping software may be employed e.g. to implement HTTP or by embedding a suitable web browser, such as Mozilla Firefox. Typically, the web scraping includes transformation of unstructured HTML-formatted data on the web into structured data for storage in a central local database or spreadsheet which facilitates analysis as described herein.

[0110] Retrieval of plural quotes may run serially or in parallel. The latter is suitable e.g. for time-bounded cases (for example, to enhance user experience it may be desired that each request for quotes be processed within only a few seconds). Retrieving quotes (aka responses to queries) serially may be suitable when coping with technological limitations such as the prevalent “look-to-book ratio” which limits the number of quote requests (looks) relative to the number of bookings. This is because serial retrieval enables use of a stopping criterion i.e. retrieval of quote n+1 occurs conditionally on results retrieved for quote n. For example, a sample batch or subset of quote requests may be sent, for which quotes are returned. The quotes are compared to a use-case specific stopping criterion (for example—“at least 10% less in cost”) and if the criterion is met, the retrieval process may stop; otherwise, an additional batch of quote requests is submitted.

[0111] Retrieved quotes each associated with a date range, are forwarded to Split Composition module (103) which composes potential split based deals by combining quotes of date ranges that were retrieved from the Sub-interval characterization Retrieval module and that together cover the originally requested hotel stay dates.

[0112] In one embodiment, the module 103 runs over the list of retrieved quotes and associated date ranges received from module 102. Module 103 may run over quotes for a first sub-interval ending at a specific day D, and then may run over quotes for a second sub-interval beginning at the next day D+1, and so on until a full cover of the originally requested stay is gained. For each cover or partition or “splitted deal”, the total price may be computed. The various covers (aka split deals, partitions) are forwarded to a client e.g. end-user or software client who is prompted to select a preferred (optimal) partition with which to continue to the booking process.

[0113] According to another embodiment, Split Composition module (103) is limited to finding partitions whose sub-ranges satisfy some condition—such as but not limited to one or more of the following conditions: all sub-ranges are in the same hotel, all sub-ranges are in the same room type, all sub-ranges have the same room number, all sub-ranges are in the same hotel chain, all sub-ranges have the same hotel rating, all sub-ranges are in hotels which are near one another to a predetermined extent, etc.

[0114] In still a further embodiment, the Date Range Decomposition module 101 is replaced by an All Possible Ranges module (104) as shown in FIG. 2. In module 104, all possible ranges are computed prior to the split composition process of module 103 (i.e. all possible intervals are handled in advance, preparatory to subsequent processing of specific given ranges of dates—rather than handling only specific intervals/ranges which could serve as sub-intervals, and only responsive to each specific given range of dates). The different covers (e.g. split deals) may be computed without any date filter or request for specific stay dates. Or, the Split Composition module (103) may receive a given request for a stay (Start date, and number of nights) which may be used to filter only potentially composed split deals or covers just for the relevant stay. In addition, a Deal Inventory 110 (e.g. Cancelon, RoomerTravel) may feed “deals” (e.g. tables or lists of plural time intervals including data characterizing each of the plural time intervals) to the Split Composition module 103, to enable the Split Composition module 103 to assemble covers that may contain split parts that are taken from the deals inventory 110. Deals typically comprise data from an external source specifying plural stay date ranges and for each such range or interval, e.g. in table form, characterization of the interval e.g. price thereof. Each entry in the table may for example comprise a date range, and some or all of: ID of the premises e.g. hotel, and characterizations such as room type, cancelation policy, price, full/half board; Internet yes/no).

[0115] An end-user or client may receive plural partitions (aka covers or split deals) from the Split Composition module (103) of FIG. 1 and may then select a single, “optimal” cover. The optimal cover is then sent to a process (105) of booking the selected split parts.

[0116] According to certain embodiments of the present invention, the booking process 105 may return a single itinerary (“Joint Booking Itinerary”) that includes multiple date ranges (aka “splits”, sub-intervals) that together cover the original requested date range (aka time interval). Alternatively, the booking process 105 may return multiple itineraries each containing a single date range or plural such ranges, that together cover the original requested date range. The booking process may employ a computerized end-user particulars form, typically only once. Each itinerary may address single or multiple suppliers (aka computerized organizations) per range of dates and/or multiple hotels and/or single or multiple room types.

[0117] It is appreciated that the systems and methods described herein may be incorporated at any layer of an information network operative for managing utilization of physical facilities. For example, conventional information networks operative for managing utilization of physical facilities may define some or all of: individual hotels e.g. as a top layer, hotel chains e.g. as a second layer, wholesalers e.g. as a third layer, GDSs e.g. as a fourth layer, OTAs e.g. as a fifth layer, and end-users e.g. at a lowest layer. At any layer from 2 onward, decomposition may be performed and N requests respectively defining said N sub-intervals may be sent upward to a layer above, however preferably, time interval splitting controller/s splitting intervals associated with a given facility, are operatively linked with only some, but not all, of the plurality of computerized organizations streaming requests to the facility.

[0118] Alternatively or in addition, the systems and methods described herein may be incorporated for various link or links of an information network that includes nodes such as but not limited to Online Travel Agencies, global distribution systems, wholesalers, reseller e.g hotel chains, and Middlemen generally, some of which are linked, however preferably, time interval splitting controller/s splitting intervals associated with a given facility, are operatively linked with only some, but not all, of the plurality of computerized organizations streaming requests to the facility.

[0119] The systems and methods described herein are suitable for any information network topology; for example, in some networks, physical facilities such as hotels and chains thereof, or rental facilities, may have wholesalers among their clients which may in turn have middlemen such as GDS's, resellers and merchants among their clients, and the middlemen may have OTAs among their clients; the OTA's may have individual human end-users among their clients. Also, various of the above categories of nodes may be each others' clients. For example, one middleman or wholesaler may be a client of another middleman or wholesaler. Or, a GDS may be a reseller's client or vice versa, a GDS may be a merchant's client or vice versa, and a reseller may be a merchant's client or vice versa. Also, links or connections described herein as indirect may alternatively be direct. For example, a physical facility e.g. chain of hotels may have a middleman as a client or vice versa, rather than the facility and the middleman being associated only via wholesalers. Similarly, a wholesaler may have an OTA as a client or vice versa, rather than the wholesaler and OTA being associated only via middlemen.

[0120] Reference is now made to FIGS. 4 and FIG. 5 which are block diagram illustrations of a system for optimizing utilization of a population of underutilized physical facilities managed by a corresponding population of facility processors. According to some embodiments of the invention the system of FIGS. 4-5 may be used for the purpose of searching and booking for hotel rooms via a booking web site 400.

[0121] The website 400 may be used as a user interface for searching for hotel rooms, booking and managing hotel room reservations. The booking web site 400 typically forwards search queries to the booking site services 403. The booking site is typically configured for using the booking site services 403 as an API for generic operations such as search, book, etc. The booking site services 403 typically uses the hotel provider characterization retrieval services 402 to search for hotel deals and typically uses the booking service 406 to book a reservation.

[0122] The Decomposition service 401 is typically configured to provide the recommended split/s e.g. responsive to a specific hotel search request. Decomposition service 401 typically determines the number of recommended split combinations based on a current query that typically includes at least date of arrival and number of days and may of course include additional parameters.

[0123] The hotel provider interval characterization retrieval services 402 manage one or more booking system adapters. Each adapter typically uses a third party API in order to perform hotel searching and booking operations. For example, the EAN adapter is responsible to cover the major Expedia Affiliate Network API endpoints, as shown.

[0124] A booking service 406 is responsible to book a new split reservation and to manage existing booking reservations. Booking service 406 typically uses the hotel provider services 402 to book a reservation from a specific hotel provider (one or more). Booking service 406 service is also typically configured to ensure/confirm the user completes the payment successfully e.g. via a third party payment service as a logical condition for booking the split reservation.

[0125] The Hotel Searching process may include any or all of the following operations, suitably ordered e.g. as shown in FIG. 4:

[0126] 1. End user searches for hotel typically using suitable criteria from the booking site 400. The booking site 400 is configured for sending the end user's searching request to the booking site services 403

[0127] 2. the booking site 400 is configured for using the decomposition module 401 to determine recommended splits to search

[0128] 3. the booking site 400 is configured for sending the recommended split requests to the hotel provider retrieval service 402

[0129] 4. the hotel provider 402 is configured for using relevant adapters, e.g. as shown, to retrieve characterizations of various sub-intervals e.g. deals defined by hotels from third party hotel providers (GDS, Wholesaler etc.), thereby to provide a “hotel searching flow result”. For example, retrieval may be implemented by any or all of the following: [0130] a. A GDS or Wholesaler may be queried for relevant hotel deals which characterize relevant sub-intervals by using an API, for example based on CORBA, Web Services, Web APIs, REST Interface or other. Deals thus collected may be copied to a Data repository (DB) of collected deals for future query, thereby reducing the number of future queries since the DB may be used as a cache for previously retrieved deals. [0131] b. A Data repository (DB) of collected deals may be queried for relevant hotel deals which characterize relevant sub-intervals by using a query language, for example based on SQL for relational database, Query Retrieval Commands for document based database, LINQ for Object-Relational-Mapper interface or other. The DB may be updated on occasion, e.g. upon each request to a GDS or Wholesaler by the user, or periodically, e.g. requesting deals which characterize certain sub-intervals every defined period of time. [0132] c. A web-scraping method may be used to retrieve deals which characterize corresponding sub-intervals e.g. by firing HTTP/HTTPs requests to a web page that contains deal characterizations e.g. price quotes, extracting the characterizations from the web page and saving them in a Data repository (DB). [0133] d. A Cache may be used for accessing recently accessed deals which characterize sub-intervals recently of interest, or frequent deals which characterize relevant sub-intervals which have frequently been of interest, within a short time, instead of either requesting the interval characterization data source with an API or querying a Data repository (DB) which may be external. The cache may be stored in memory or in disk. A Bloom filter may be employed to determine whether a particular query about a particular interval at a particular facility was asked recently and if so, to access the response thereto from cached results. [0134] e. A Deals Inventory may be queried for ready made deals, e.g. lists or tables or sets of sub-intervals and characterizations thereof, which may have been published as special sale offers e.g. by an external Deals Inventory entity such as roomertravel.com.

[0135] The Hotel Booking process may include any or all of the following operations, suitably ordered e.g. as shown in FIG. 5:

[0136] 1. an individual one of plural split hotel deals may be selected by an end-user from the hotel searching flow result generated in operation 4 of FIG. 4, in the booking site 400. The booking site 400 is configured for sending the selected deal to the booking site services 403.

[0137] 2. the booking services site 403 ensures the reservation is still available, and is then operative for sending the selected deal to the booking service 406.

[0138] 3. the booking service 406 may optionally redirect the end-user to a third party payment service page.

[0139] 4. the payment service may be configured for charging the end-user, and may then send the payment confirmation back to the booking service 406

[0140] 5. the hotel provider service 402 is configured for booking each of the split reservation parts (sub-intervals) e.g. using a suitable hotel provider service API (in one or more transactions).

[0141] 6. a selected adapter in the hotel provider service is typically operative for using the third party hotel provider API to book one (or more) of the split reservation parts (sub-intervals).

[0142] FIG. 6 is a simplified flow diagram of a method for optimizing utilization of a population of underutilized physical facilities managed by a corresponding population of facility processors, where according to certain embodiments utilization is allocated by each individual facility processor responsive to a stream of incoming requests to the individual facility processor from any of a plurality of computerized organizations, each request defining a time interval, each time interval including a number of time units and being associated with a value allocated by the facility processor. The method of FIG. 6 may for example be employed by or in conjunction with any of the apparatus of FIGS. 2-5 and typically includes some or all of the illustrated operations, suitably ordered e.g. as shown.

[0143] Operation 601: using a time interval splitting controller operative to communicate with some, but not all, of the plurality of computerized organizations, and to perform the following operations when a computerized organization, from among some, but not all, of the plurality of computerized organizations, seeks to reserve at least one portion of at least one physical facility for a specific time interval.

[0144] Operation 602: decomposition, by partitioning the specific time interval at least twice, using a processor, thereby to define at least first and second partitions thereof, each partition including a sequence of sub-intervals each having a length which does not exceed the specific time interval's length.

[0145] Operation 603: accessing at least one computerized data repository to determine a characterization of each sub-interval including a value allocated thereto by at least one facility processor

[0146] Operation 604: computing a first value for said first partition by summing values, accessed from said data repository, allocated respectively to sub-intervals defined by said first partition.

[0147] Operation 605: computing a second value for said second partition by summing values associated respectively with sub-intervals defined by said second partition.

[0148] Operation 606: identifying an optimal partition from among said at least first and second partitions, the optimal partition including, for at least one incoming request, N>1 sub-intervals whose combined length equals said specific time interval.

[0149] Operation 607: causing the computerized organization which is associated with the time interval splitting controller to send N requests to the individual facility processor respectively defining said N sub-intervals as the respective requests' time intervals.

[0150] It is appreciated that provision of a time interval splitting controller as described herein is counter-intuitive, inter alia because it would be natural to assume that attempting to “beat the system” by partitioning each of certain intervals having certain value into sub-intervals whose combined values yield an optimization, would at best be self-defeating because the facility processor would, responsively, be re-programmed by the revenue manager, thereby to re-design its value allocations to block the time interval splitting controller's ability to generate optimizations, e.g. by ensuring that any interval, under any partition, would have a combined value which equals the value of the interval itself. However, in fact, if a time interval splitting controller is associated with only some, not all, of the plurality of computerized organizations streaming requests to the facility, then game-theory type optimization by a rational facility processor will continue to cause the facility processor to allocate value in a manner which defines intervals, which, under certain partitions, have a combined value which differs from the value of the interval itself. This feature is again counter-intuitive since it would be normally be assumed that if a time interval splitting controller associated with some computerized organizations is good, then associating a time interval splitting controller with more and more computerized organizations would be even better; however simulations show that this is the case only up to a point.

[0151] According to certain embodiments, ranges may be split even within a single facility such that plural sub ranges are defined, each for a utilization of resources in a single facility e.g. each for a stay at a different sub-interval of time, but within the same hotel.

[0152] Each functionality herein may be implemented in software, firmware, hardware or any combination thereof. Functionality stipulated as being software-implemented may be implemented by an equivalent hardware module and vice-versa.

[0153] It is appreciated that terminology such as “mandatory”, “required”, “need” and “must” refer to implementation choices made within the context of a particular implementation or application described herewithin for clarity and are not intended to be limiting since in an alternative implementation, the same elements might be defined as not mandatory and not required or might even be eliminated altogether.

[0154] Components described herein as software may, alternatively, be implemented wholly or partly in hardware and/or firmware, if desired, using conventional techniques, and vice-versa. Each module or component or processor may be centralized in a single location or distributed over several locations.

[0155] Included in the scope of the present disclosure, inter alia, are electromagnetic signals in accordance with the description herein. These may carry computer-readable instructions for performing any or all of the operations of any of the methods shown and described herein, in any suitable order including simultaneous performance of suitable groups of operations as appropriate; machine-readable instructions for performing any or all of the operations of any of the methods shown and described herein, in any suitable order; program storage devices readable by machine, tangibly embodying a program of instructions executable by the machine to perform any or all of the operations of any of the methods shown and described herein, in any suitable order; a computer program product comprising a computer useable medium having computer readable program code, such as executable code, having embodied therein, and/or including computer readable program code for performing any or all of the operations of any of the methods shown and described herein, in any suitable order; any technical effects brought about by any or all of the operations of any of the methods shown and described herein, when performed in any suitable order; any suitable apparatus or device or combination of such, programmed to perform, alone or in combination, any or all of the operations of any of the methods shown and described herein, in any suitable order; electronic devices each including at least one processor and/or cooperating input device and/or output device and operative to perform e.g. in software any operations shown and described herein; information storage devices or physical records, such as disks or hard drives, causing at least one computer or other device to be configured so as to carry out any or all of the operations of any of the methods shown and described herein, in any suitable order; at least one program pre-stored e.g. in memory or on an information network such as the

[0156] Internet, before or after being downloaded, which embodies any or all of the operations of any of the methods shown and described herein, in any suitable order, and the method of uploading or downloading such, and a system including server/s and/or client/s for using such; at least one processor configured to perform any combination of the described operations or to execute any combination of the described modules; and hardware which performs any or all of the operations of any of the methods shown and described herein, in any suitable order, either alone or in conjunction with software. Any computer-readable or machine-readable media described herein is intended to include non-transitory computer- or machine-readable media.

[0157] Any computations or other forms of analysis described herein may be performed by a suitable computerized method. Any operation or functionality described herein may be wholly or partially computer-implemented e.g. by one or more processors. The invention shown and described herein may include (a) using a computerized method to identify a solution to any of the problems or for any of the objectives described herein, the solution optionally includes at least one of a decision, an action, a product, a service or any other information described herein that impacts, in a positive manner, a problem or objectives described herein; and (b) outputting the solution.

[0158] The system may, if desired, be implemented as a web-based system employing software, computers, routers and telecommunications equipment as appropriate.

[0159] Any suitable deployment may be employed to provide functionalities e.g. software functionalities shown and described herein. For example, a server may store certain applications, for download to clients, which are executed at the client side, the server side serving only as a storehouse. Some or all functionalities e.g. software functionalities shown and described herein may be deployed in a cloud environment. Clients e.g. mobile communication devices such as smartphones may be operatively associated with, but external to, the cloud.

[0160] The scope of the present invention is not limited to structures and functions specifically described herein and is also intended to include devices which have the capacity to yield a structure, or perform a function, described herein, such that even though users of the device may not use the capacity, they are, if they so desire, able to modify the device to obtain the structure or function.

[0161] Features of the present invention, including operations, which are described in the context of separate embodiments may also be provided in combination in a single embodiment. For example, a system embodiment is intended to include a corresponding process embodiment and vice versa. Also, each system embodiment is intended to include a server-centered “view” or client centered “view”, or “view” from any other node of the system, of the entire functionality of the system , computer-readable medium, apparatus, including only those functionalities performed at that server or client or node. Features may also be combined with features known in the art and particularly although not limited to those described in the Background section or in publications mentioned therein.

[0162] Conversely, features of the invention, including operations, which are described for brevity in the context of a single embodiment or in a certain order may be provided separately or in any suitable sub-combination, including with features known in the art (particularly although not limited to those described in the Background section or in publications mentioned therein) or in a different order. “e.g.” is used herein in the sense of a specific example which is not intended to be limiting. Each method may comprise some or all of the operations illustrated or described, suitably ordered e.g. as illustrated or described herein.

[0163] Devices, apparatus or systems shown coupled in any of the drawings may in fact be integrated into a single platform in certain embodiments or may be coupled via any appropriate wired or wireless coupling such as but not limited to optical fiber, Ethernet, Wireless LAN, HomePNA, power line communication, cell phone, Smart Phone (e.g. iPhone), Tablet, Laptop, PDA, Blackberry GPRS, Satellite including GPS, or other mobile delivery. It is appreciated that in the description and drawings shown and described herein, functionalities described or illustrated as systems and sub-units thereof can also be provided as methods and operations therewithin, and functionalities described or illustrated as methods and operations therewithin can also be provided as systems and sub-units thereof. The scale used to illustrate various elements in the drawings is merely exemplary and/or appropriate for clarity of presentation and is not intended to be limiting.