• Aucun résultat trouvé

Strategy-proof tie-breaking

N/A
N/A
Protected

Academic year: 2021

Partager "Strategy-proof tie-breaking"

Copied!
48
0
0

Texte intégral

Loading

Références

Documents relatifs

In approving the regional strategy, the Af- rica regional committee called on WHO Member States in Africa to "give particular attention to the most severe oral

Despite the fact that in many settings obvious strategy-proofness becomes signi…cantly more restrictive than just strategy-proofness, we surprisingly …nd that, for the discrete

However, it is known that the “slowly-growing search space” maxim, which states that strategies which minimise the number of derived clauses over time are more likely to succeed, is

Figure 3(b) depicts a solution using a self-made priority queue based on a heap and a separate array for tracking the location of graph vertices in the heap (the location information

Ex-post, typically in spring or summer of the following year, the quantity Q(s) is allocated among farmers, according to one of the following institu- tional systems: either a

Moreover, deterministic lower bounds of strategy-proof mechanisms are shown to be: at least 3/2 in a tree metric space, utilitarian objective; at least 3 in a general metric

data covering the whole eruption (grey) and the intrusion determined for the first part of the eruption using the Projected Disk method with cGNSS data, InSAR S1 D1 data or

Since this more gênerai formulation cannot be solved via the standard linear assignment model, two algorithms are presented for determining the optimal weak ordering..