No. Title Author Year
1 Approximately Strategyproof Tournament Rules: On Large Manipulating Sets and Cover-Consistence Schvartzman, Ariel et al. 2020
2 Asynchronous Majority Dynamics in Preferential Attachment Trees Bahrani, Maryam et al. 2020
3 Implementation in Advised Strategies: Welfare Guarantees from Posted-Price Mechanisms When Demand Queries Are NP-Hard Cai, Linda et al. 2020
4 New Query Lower Bounds for Submodular Function Minimization Graur, Andrei et al. 2020
5 Optimal Single-Choice Prophet Inequalities from Samples Rubinstein, Aviad et al. 2020
6 Bitcoin: A Natural Oligopoly Arnosti, Nick et al. 2018
7 Computing Exact Minimum Cuts Without Knowing the Graph Rubinstein, Aviad et al. 2018
8 Condorcet-Consistent and Approximately Strategyproof Tournament Rules Schneider, Jon et al. 2017
9 Reaching Consensus via Non-Bayesian Asynchronous Learning in Social Networks Feldman, Michal et al. 2014
Current Page :
Number of result pages: 1
Number of documents: 9

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI