No. Title Author Year
1 Credible, Strategyproof, Optimal, and Bounded Expected-Round Single-Item Auctions for All Distributions Essaidi, Meryem et al. 2022
2 Approximately Strategyproof Tournament Rules in the Probabilistic Setting Ding, Kimberly et al. 2021
3 Approximately Strategyproof Tournament Rules: On Large Manipulating Sets and Cover-Consistence Schvartzman, Ariel et al. 2020
4 Asynchronous Majority Dynamics in Preferential Attachment Trees Bahrani, Maryam et al. 2020
5 Implementation in Advised Strategies: Welfare Guarantees from Posted-Price Mechanisms When Demand Queries Are NP-Hard Cai, Linda et al. 2020
6 New Query Lower Bounds for Submodular Function Minimization Graur, Andrei et al. 2020
7 Optimal Single-Choice Prophet Inequalities from Samples Rubinstein, Aviad et al. 2020
8 Bitcoin: A Natural Oligopoly Arnosti, Nick et al. 2018
9 Computing Exact Minimum Cuts Without Knowing the Graph Rubinstein, Aviad et al. 2018
10 Condorcet-Consistent and Approximately Strategyproof Tournament Rules Schneider, Jon et al. 2017
11 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: 11


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