CLIAMS:We claim:
1. A method for optimizing investment fund allocation for an application, comprising:
identifying a directed graph representative of the application, the directed graph comprising a plurality of nodes and paths, wherein an incremental investment amount and an incremental revenue value are associated with the respective nodes and paths;
determining, using a computer processor, a path of the directed graph that provides a maximum return on investment among the plurality of paths of the directed graph;
allocating an investment amount, equaling the incremental investment amount associated with the path, to the path of the directed graph; and
updating the incremental revenue value associated with the respective nodes and paths based on the incremental revenue value associated with the path of the directed graph.
2. The method of claim 1, further comprising:
repeating the determining, allocating, and updating steps until no investment amount is available.

3. The method of claim 1, wherein determining the path of the directed graph that provides the maximum return on investment is based, at least in part, on a ratio of the incremental revenue value to the incremental investment amount associated with the respective nodes and paths.

4. The method of claim 3, wherein determining the path of the directed graph that provides the maximum return on investment comprises:
sorting, a plurality of paths associated with the respective nodes, according to the ratio of the incremental revenue value to the incremental investment amount for the plurality of paths associated with the respective nodes.
5. The method of claim 4, further comprising:
determining that remaining investment funds are insufficient to allocate to a particular path of the directed graph;
determining that a user selects to maximize spending with best possible return on investment; and
excluding the particular path as the path of the directed graph.

6. The method of claim 1, wherein updating the incremental revenue value associated with the respective nodes and paths comprises:
determining that one or more of the respective nodes and paths share a common node with the path of the directed graph; and
increasing, the incremental revenue value associated with the one or more of the respective nodes and path, by a first amount, based at least in part, on the incremental revenue value associated with the path of the directed graph.

7. The method of claim 6, wherein updating the incremental revenue value associated with the respective nodes and paths further comprises:
determining that the one or more of the respective nodes and paths share a common link with the path of the directed graph; and
increasing, the incremental revenue value associated with the one or more respective nodes and path, by a second amount, based at least in part, on the incremental revenue value associated with the path of the directed graph.

8. The method of claim 1, wherein the application is an e-commerce website.

9. A system for optimizing investment fund allocation for an application, comprising:
one or more hardware processors; and
a memory storing instructions that, when executed by the one or more hardware processors, cause the one or more hardware processors to perform operations including:
identifying a directed graph representative of the application, the directed graph comprising a plurality of nodes and paths, wherein an incremental investment amount and an incremental revenue value are associated with the respective nodes and paths;
determining a path of the directed graph that provides a maximum return on investment among the plurality of paths of the directed graph;
allocating an investment amount, equaling the incremental investment amount associated with the path, to the path of the directed graph; and
updating the incremental revenue value associated with the respective nodes and paths based on the incremental revenue value associated with the path of the directed graph.
10. The system of claim 9, wherein the memory stores instructions that, when executed by the one or more hardware processors, cause the one or more hardware processors to further perform operations including:
repeating the determining, allocating, and updating steps until no investment amount is available.

11. The system of claim 9, wherein determining the path of the directed graph that provides the maximum return on investment is based, at least in part, on a ratio of the incremental revenue value to the incremental investment amount associated with the respective nodes and paths.

12. The system of claim 11, wherein determining the path of the directed graph that provides the maximum return on investment comprises:
sorting, a plurality of paths associated with the respective nodes, according to the ratio of the incremental revenue value to the incremental investment amount for the plurality of paths associated with the respective nodes.
13. The system of claim 12, wherein the memory stores instructions that, when executed by the one or more hardware processors, cause the one or more hardware processors to further perform operations including:
determining that remaining investment funds are insufficient to allocate to a particular path of the directed graph;
determining that a user selects to maximize spending with best possible return on investment; and
excluding the particular path as the path of the directed graph.

14. The system of claim 9, wherein updating the incremental revenue value associated with the respective nodes and paths comprises:
determining that one or more of the respective nodes and paths share a common node with the path of the directed graph; and
increasing, the incremental revenue value associated with the one or more of the respective nodes and path, by a first amount, based at least in part, on the incremental revenue value associated with the path of the directed graph.

15. The system of claim 14, wherein updating the incremental revenue value associated with the respective nodes and paths further comprises:
determining that the one or more of the respective nodes and paths share a common link with the path of the directed graph; and
increasing, the incremental revenue value associated with the one or more respective nodes and path, by a second amount, based at least in part, on the incremental revenue value associated with the path of the directed graph.

16. The system of claim 9, wherein the application is an e-commerce website.

17. A non-transitory computer-readable medium storing instructions for optimizing investment fund allocation for an application that, when executed by a processor, cause the processor to perform operations including:
identifying a directed graph representative of the application, the directed graph comprising a plurality of nodes and paths, wherein an incremental investment amount and an incremental revenue value are associated with the respective nodes and paths;
determining a path of the directed graph that provides a maximum return on investment among the plurality of paths of the directed graph;
allocating an investment amount, equaling the incremental investment amount associated with the path, to the path of the directed graph; and
updating the incremental revenue value associated with the respective nodes and paths based on the incremental revenue value associated with the path of the directed graph.
Dated this 21st day of August, 2014
Shwetha A. Chimalgi
Of K & S Partners
Agent for the Applicants
,TagSPECI:FIELD OF THE INVENTION
This disclosure relates generally to optimizing application design optimization and, more particularly, to systems and methods for allocating investment fund for an application to maximize revenue generation by the application.