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

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