Prior-independent mechanism

Results: 9



#Item
15 Prior-independent Approximation In the last two chapters we discussed mechanism that performed well for a given Bayesian prior distribution. Assuming the existence of such a Bayesian prior is natural when deriving mech

5 Prior-independent Approximation In the last two chapters we discussed mechanism that performed well for a given Bayesian prior distribution. Assuming the existence of such a Bayesian prior is natural when deriving mech

Add to Reading List

Source URL: jasonhartline.com

- Date: 2017-07-28 06:04:18
    2Prior-independent Multi-Parameter Mechanism Design Nikhil Devanur1 , Jason Hartline2 ? , Anna Karlin3 , and Thach Nguyen3 1  , Microsoft Research

    Prior-independent Multi-Parameter Mechanism Design Nikhil Devanur1 , Jason Hartline2 ? , Anna Karlin3 , and Thach Nguyen3 1 , Microsoft Research

    Add to Reading List

    Source URL: users.eecs.northwestern.edu

    - Date: 2011-09-30 18:31:24
      3Near-optimal multi-unit auctions with ordered bidders Elias Koutsoupias London

      Near-optimal multi-unit auctions with ordered bidders Elias Koutsoupias London

      Add to Reading List

      Source URL: www.maths.lse.ac.uk

      Language: English - Date: 2013-10-31 12:50:34
      4A Optimal and Robust Mechanism Design with Interdependent Values TIM ROUGHGARDEN, Stanford University INBAL TALGAM-COHEN, Stanford University  We study interdependent value settings [Milgrom and Weberand extend se

      A Optimal and Robust Mechanism Design with Interdependent Values TIM ROUGHGARDEN, Stanford University INBAL TALGAM-COHEN, Stanford University We study interdependent value settings [Milgrom and Weberand extend se

      Add to Reading List

      Source URL: theory.stanford.edu

      Language: English - Date: 2013-12-08 09:31:37
      5Supply-Limiting Mechanisms TIM ROUGHGARDEN, Department of Computer Science, Stanford University INBAL TALGAM-COHEN, Department of Computer Science, Stanford University QIQI YAN, Department of Computer Science, Stanford U

      Supply-Limiting Mechanisms TIM ROUGHGARDEN, Department of Computer Science, Stanford University INBAL TALGAM-COHEN, Department of Computer Science, Stanford University QIQI YAN, Department of Computer Science, Stanford U

      Add to Reading List

      Source URL: theory.stanford.edu

      Language: English - Date: 2015-11-02 19:36:35
      6Supply-Limiting Mechanisms TIM ROUGHGARDEN, Department of Computer Science, Stanford University INBAL TALGAM-COHEN, Department of Computer Science, Stanford University QIQI YAN, Department of Computer Science, Stanford U

      Supply-Limiting Mechanisms TIM ROUGHGARDEN, Department of Computer Science, Stanford University INBAL TALGAM-COHEN, Department of Computer Science, Stanford University QIQI YAN, Department of Computer Science, Stanford U

      Add to Reading List

      Source URL: www.qiqiyan.com.s3-website-us-east-1.amazonaws.com

      Language: English - Date: 2012-07-04 18:28:35
      7Envy, Truth, and Profit ∗ Jason D. Hartline  Electrical Engineering and Computer Science

      Envy, Truth, and Profit ∗ Jason D. Hartline Electrical Engineering and Computer Science

      Add to Reading List

      Source URL: www.qiqiyan.com.s3-website-us-east-1.amazonaws.com

      Language: English - Date: 2012-07-04 18:28:34
      8Prior-Free Auctions with Ordered Bidders Stefano Leonardi∗ Sapienza University of Rome Via Ariosto, Rome, Italy

      Prior-Free Auctions with Ordered Bidders Stefano Leonardi∗ Sapienza University of Rome Via Ariosto, Rome, Italy

      Add to Reading List

      Source URL: theory.stanford.edu

      Language: English - Date: 2012-04-26 10:12:13
      9CS364A: Algorithmic Game Theory Lecture #6: Simple Near-Optimal Auctions∗ Tim Roughgarden† October 9,

      CS364A: Algorithmic Game Theory Lecture #6: Simple Near-Optimal Auctions∗ Tim Roughgarden† October 9,

      Add to Reading List

      Source URL: theory.stanford.edu

      Language: English - Date: 2015-09-22 16:30:12