enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Efficient envy-free division - Wikipedia

    en.wikipedia.org/wiki/Efficient_envy-free_division

    Let Xk be an allocation in the k-replicated economy where all copies of the same agent receive the same bundle as the original agent in X. The allocation X is called sigma-optimal if for every k, the allocation Xk is Pareto-optimal. Lemma: [7]: 528 An allocation is sigma-optimal, if-and-only-if it is a competitive equilibrium.

  3. Welfare maximization - Wikipedia

    en.wikipedia.org/wiki/Welfare_maximization

    An additive agent has a utility function that is an additive set function: for every additive agent i and item j, there is a value ,, such that () =, for every set Z of items. When all agents are additive, welfare maximization can be done by a simple polynomial-time algorithm: give each item j to an agent for whom v i , j {\displaystyle v_{i,j ...

  4. Mathematical optimization - Wikipedia

    en.wikipedia.org/wiki/Mathematical_optimization

    The function f is variously called an objective function, criterion function, loss function, cost function (minimization), [8] utility function or fitness function (maximization), or, in certain fields, an energy function or energy functional. A feasible solution that minimizes (or maximizes) the objective function is called an optimal solution.

  5. Allocative efficiency - Wikipedia

    en.wikipedia.org/wiki/Allocative_efficiency

    Allocation efficiency occurs when there is an optimal distribution of goods and services, considering consumer's preference. When the price equals marginal cost of production, the allocation efficiency is at the output level. This is because the optimal distribution is achieved when the marginal utility of good equals the marginal cost.

  6. Pareto front - Wikipedia

    en.wikipedia.org/wiki/Pareto_front

    A significant aspect of the Pareto frontier in economics is that, at a Pareto-efficient allocation, the marginal rate of substitution is the same for all consumers. [5] A formal statement can be derived by considering a system with m consumers and n goods, and a utility function of each consumer as = where = (,, …,) is the vector of goods, both for all i.

  7. Optimal computing budget allocation - Wikipedia

    en.wikipedia.org/wiki/Optimal_Computing_Budget...

    In Computer Science, Optimal Computing Budget Allocation (OCBA) is a simulation optimization method designed to maximize the Probability of Correct Selection (PCS) while minimizing computational costs. First introduced by Dr. Chun-Hung Chen in the mid-1990s, OCBA determines how many simulation runs (or how much computational time) or the number ...

  8. Utility maximization problem - Wikipedia

    en.wikipedia.org/wiki/Utility_maximization_problem

    If Walras's law has been satisfied, the optimal solution of the consumer lies at the point where the budget line and optimal indifference curve intersect, this is called the tangency condition. [3] To find this point, differentiate the utility function with respect to x and y to find the marginal utilities, then divide by the respective prices ...

  9. Transportation theory (mathematics) - Wikipedia

    en.wikipedia.org/wiki/Transportation_theory...

    The following simple example illustrates the importance of the cost function in determining the optimal transport plan. Suppose that we have books of equal width on a shelf (the real line), arranged in a single contiguous block. We wish to rearrange them into another contiguous block, but shifted one book-width to the right.

  1. Related searches optimum allocation calculation formula in google sheets examples images

    allocative efficiency formulaallocation efficiency definition
    mathematical optimization formulas