scholarly journals Partial strategyproofness: Relaxing strategyproofness for the random assignment problem

2021 ◽  
Vol 191 ◽  
pp. 105144
Author(s):  
Timo Mennle ◽  
Sven Seuken
2006 ◽  
Vol DMTCS Proceedings vol. AG,... (Proceedings) ◽  
Author(s):  
Johan Wästlund

International audience We explore a similarity between the $n$ by $n$ random assignment problem and the random shortest path problem on the complete graph on $n+1$ vertices. This similarity is a consequence of the proof of the Parisi formula for the assignment problem given by C. Nair, B. Prabhakar and M. Sharma in 2003. We give direct proofs of the analogs for the shortest path problem of some results established by D. Aldous in connection with his $\zeta (2)$ limit theorem for the assignment problem.


2018 ◽  
Vol 6 (1) ◽  
pp. 1-28 ◽  
Author(s):  
Satoru Fujishige ◽  
Yoshio Sano ◽  
Ping Zhan

2002 ◽  
Vol 19 (3) ◽  
pp. 623-636 ◽  
Author(s):  
Anna Bogomolnaia ◽  
Hervé Moulin

2017 ◽  
Vol 95 (5) ◽  
Author(s):  
Sergio Caracciolo ◽  
Matteo P. D'Achille ◽  
Enrico M. Malatesta ◽  
Gabriele Sicuro

Sign in / Sign up

Export Citation Format

Share Document