scholarly journals An optimal, strategy-proof scheme for multi-path traffic assignment in non-cooperative networks

2010 ◽  
Vol 9 (3) ◽  
pp. 1012-1021 ◽  
Author(s):  
Fan Wu ◽  
Sheng Zhong ◽  
Jiqiang Liu
2020 ◽  
Vol 45 (1) ◽  
pp. 353-368 ◽  
Author(s):  
Sophie Bade

Fix a Pareto-optimal, strategy-proof, and nonbossy deterministic matching mechanism and define a random matching mechanism by assigning agents to the roles in the mechanism via a uniform lottery. Given a profile of preferences, the lottery over outcomes that arises under the random matching mechanism is identical to the lottery that arises under random serial dictatorship, where the order of dictators is uniformly distributed. This result extends the celebrated equivalence between the core from random endowments and random serial dictatorship to the grand set of all Pareto-optimal, strategy-proof, and nonbossy matching mechanisms.


1986 ◽  
Vol 25 (04) ◽  
pp. 207-214 ◽  
Author(s):  
P. Glasziou

SummaryThe development of investigative strategies by decision analysis has been achieved by explicitly drawing the decision tree, either by hand or on computer. This paper discusses the feasibility of automatically generating and analysing decision trees from a description of the investigations and the treatment problem. The investigation of cholestatic jaundice is used to illustrate the technique.Methods to decrease the number of calculations required are presented. It is shown that this method makes practical the simultaneous study of at least half a dozen investigations. However, some new problems arise due to the possible complexity of the resulting optimal strategy. If protocol errors and delays due to testing are considered, simpler strategies become desirable. Generation and assessment of these simpler strategies are discussed with examples.


Sign in / Sign up

Export Citation Format

Share Document