This mechanism is, necessarily, not budget balanced and we also provide a budget-balanced mechanism (which is also computationally efficient, incentive compatible and individually rational) that achieves high welfare.
However, this exhaustiveness has some drawbacks: computing all the potential trajectories of the vehicles with these models is computationally expensive and not compatible with real-time risk assessment.
As discussed above, to obtain an optimal galled network we must solve a number of instances of two problems that are both computationally hard, the Maximum Compatible Subset problem and the MAP.
This high-level reasoning is computationally expensive, and not always compatible with real-time risk estimation.
This provides a computationally efficient, individually rational and incentive compatible welfare maximizing mechanism.
Both the MS-MDA and M-MDA mechanisms are incentive compatible, individually rational, budget balanced and computationally efficient.
We present a new framework for the design of computationally-efficient and incentive-compatible mechanisms for combinatorial auctions.
In this vein, Harrison and McDaniel (2008) provide experimental evidence suggesting that the 'Kemeny rule', an extension of pairwise majority voting designed to avoid Condorcet cycles, is 'behaviourally incentive-compatible': i.e., strategic manipulation is computationally hard.
This is compatible with the Balanced Random Forest (BRF) approach, which is computationally more efficient with large imbalanced data, since each tree only uses a small portion of the training set to grow.
This means that the numerical procedure used for the RTE must be computationally efficient to permit its inclusion in the other submodels, and must be compatible with the other transport equations.
