Sentence examples for the valuation functions from inspiring English sources

One now needs to argue that the valuation functions must satisfy the single crossing condition.

Moreover, there is no closed formula that relates the valuation functions to the number of queries required by the protocol.

We design both deterministic and randomized cake cutting mechanisms that are truthful and fair under different assumptions with respect to the valuation functions of the agents.

The valuation functions were not stable across both sites for most of the models considered and some of the attributes changed their values between the two points of the consumption process.

This condition, which imposes a restriction on the behavior of the one-sided directional derivatives of the valuation functions with respect to individual types, is also shown to be sufficient and necessary to obtain the Payoff Equivalence principle for dominant strategy mechanisms whose choice rules are affine maximizers.

The only existing finite envy-free cake cutting protocol for any number of players, designed by Brams and Taylor [4], has the property that its runtime can be made arbitrarily large by setting up the valuation functions of the players appropriately.

As in section 4.2 the valuation function has the range {0,1}.

The valuation function, as in a Kripke model, allows us to assign properties to the worlds.

However, here and in all models below we assume that the valuation function has the range {0,1}.

This means that the valuation function v treats modal formulas as atomic (interprtetations for S2 or S3 are special cases of interpretations for S0.5: those cases in which the valuation function uniformly treats the boxed formulas as false, etc., at non-normal worlds).

If we accept the constraints (TRL1) and (TRL2′), and use the above recursive definition of the valuation function T t,p), we obtain a semantics according to which (T1) and (T2) are valid.