Multi-parameter Auctions with Online Supply

No abstract is available for this paper.

• Publication year

  2015

• Venue

  arXiv.org

• Publication date

  2015-11-11

• Fields of study

  Mathematics, Computer Science, Economics

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Auctions for online display advertising exchanges: approximations and design

  2013cited by this paper
• General Truthfulness Characterizations Via Convex Analysis

  2012cited by this paper
• Near optimal online algorithms and fast approximation algorithms for resource allocation problems

  2011cited by this paper
• Truthful mechanisms with implicit payment computation

  2010cited by this paper
• The power of randomness in bayesian optimal mechanism design

  2010cited by this paper
• Pure and Bayes-Nash Price of Anarchy for Generalized Second Price Auction

  2010cited by this paper
• Online Ad Assignment with Free Disposal

  2009cited by this paper
• The adwords problem: online keyword matching with budgeted bidders under random permutations

  2009cited by this paper
• The price of truthfulness for pay-per-click auctions

  2009cited by this paper
• Limited and online supply and the bayesian foundations of prior-free mechanism design

  2009cited by this paper
• Auctions with online supply

  2009influential reference
• Online Stochastic Matching: Beating 1-1/e

  2009cited by this paper
• Prompt Mechanisms for Online Auctions

  2008cited by this paper
• Multi-unit Auctions with Budget Limits

  2008cited by this paper
• Characterizing truthful multi-armed bandit mechanisms: extended abstract

  2008cited by this paper
• Truthful germs are contagious: a local to global characterization of truthfulness

  2008cited by this paper
• Matroids, secretary problems, and online mechanisms

  2007cited by this paper
• Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue

  2007cited by this paper
• Allocating online advertisement space with unreliable estimates

  2007cited by this paper
• Truthful auctions for pricing search keywords

  2006cited by this paper
• Multi-unit auctions with unknown supply

  2006cited by this paper
• A multiple-choice secretary algorithm with applications to online auctions

  2005cited by this paper
• AdWords and generalized on-line matching

  2005cited by this paper
• Haggling over substitutes

  2004cited by this paper
• Adaptive limited-supply online auctions

  2004cited by this paper
• Competitive analysis of incentive compatible on-line auctions

  2000cited by this paper
• A necessary and sufficient condition for rationalizability in a quasi-linear context

  1987cited by this paper
• [Computers and Society]: Electronic Commerce—payment

  year unknowncited by this paper

• Truthfulness in advertising? Approximation mechanisms for knapsack bidders

  2018cites this paper