SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Automated Online Mechanism Design and Prophet Inequalities
8 references·8 citing·42 second hop
Automated Online Mechanism Design and Prophet Inequalities (2018)Automated Online Mechanism Design and Pro…Dynamic Mechanism Design for Online Commerce (2006)Dynamic Mechanism Design for …Online auctions with re-usable goods (2005)Online auctions with re-usabl…The value of knowing a demand curve: bounds on regret for online posted-price auctions (2004)The value of knowing a demand…Online learning in online auctions (2004)Online learning in online auc…Adaptive limited-supply online auctions (2004)Adaptive limited-supply onlin…An MDP-Based Approach to Online Mechanism Design (2003)An MDP-Based Approach to Onli…Complexity of Mechanism Design (2002)Complexity of Mechanism DesignOptimal Auction Design (1981)Optimal Auction DesignDynamic Pricing (and Assortment) Under a Static Calendar (2020)Dynamic Pricing (and Assortme…Mechanism Design and Approximation (2014)Mechanism Design and Approxim…On revenue in the generalized second price auction (2012)On revenue in the generalized…Bayesian Combinatorial Auctions: Expanding Single Buyer Mechanisms to Many Buyers (2011)Bayesian Combinatorial Auctio…Bayesian Combinatorial Auctions: Expanding Single Buyer Mechanisms to Many Buyers (2011)Bayesian Combinatorial Auctio…Mechanisms for Making Crowds Truthful (2009)Mechanisms for Making Crowds …Mechanisms for Making Crowds Truthful (2009)Mechanisms for Making Crowds …Posted prices vs. negotiations (2008)Posted prices vs. negotiationsCOUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS (1961)Multipart pricing of public goods (1971)Incentives in Teams (1973)Automated Mechanism Design: A New Application Area for Search Algorithms (2003)Markets come to bits: Evolution, computation and markomata in economic science (2007)Evolutionary mechanism design: a review (2009)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Gambling in a rigged casino: The adversarial multi-armed bandit problem (2002)The Nonstochastic Multiarmed Bandit Problem (2002)Data market platforms (2020)Algorithmic Mechanism Design (2001)Truth revelation in approximately efficient combinatorial auctions (2002)Dynamic Revenue Maximization with Heterogeneous Objects: A Mechanism Design Approach (2009)Optimal dynamic mechanism design with deadlines (2015)Thickness and Information in Dynamic Matching Markets (2019)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Nearly Tight Bounds for the Continuum-Armed Bandit Problem (2004)Bandits with Knapsacks (2013)The sample complexity of revenue maximization (2014)Truthful mechanisms for one-parameter agents (2001)Worst-case optimal redistribution of VCG payments in multi-unit auctions (2008)A framework for truthful online auctions in cloud computing with heterogeneous user demands (2013)A Framework for Truthful Online Auctions in Cloud Computing with Heterogeneous User Demands (2015)Competitive auctions and digital goods (2001)Twenty Lectures on Algorithmic Game Theory (2016)The Market for "Lemons": Quality Uncertainty and the Market Mechanism (1970)Moral Hazard in Teams (1982)A Conceptual Model of Service Quality and Its Implications for Future Research (1985)Incentive Mechanisms for Community Sensing (2013)An Overview of Applications of Proper Scoring Rules (2016)An Information Theoretic Framework For Designing Information Elicitation Mechanisms That Reward Truth-telling (2019)Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons (1994)Pricing WiFi at Starbucks (2003)Online Auction and List Price Revenue Management (2007)Supermodularity and Complementarity (2011)Optimal Dynamic Mechanism Design and the Virtual-Pivot Mechanism (2013)A Theory of Auctions and Competitive Bidding (1982)Efficient mechanisms for bilateral trading (1983)The interdisciplinary study of coordination (1994)Making the Most of Your Samples (2015)Ironing in the Dark (2016)Simple versus Optimal Contracts (2019)
this work references cited by second hop

References

  • 1981Optimal Auction Design5,938 cited
  • 2004The value of knowing a demand curve: bounds on regret for online posted-price auctions296 cited
  • 2002Complexity of Mechanism Design251 cited
  • 2004Adaptive limited-supply online auctions180 cited
  • 2004Online learning in online auctions158 cited
  • 2005Online auctions with re-usable goods151 cited
  • 2006Dynamic Mechanism Design for Online Commerce146 cited
  • 2003An MDP-Based Approach to Online Mechanism Design140 cited

Cited by

  • 2014Mechanism Design and Approximation119 cited
  • 2009Mechanisms for Making Crowds Truthful99 cited
  • 2011Bayesian Combinatorial Auctions: Expanding Single Buyer Mechanisms to Many Buyers95 cited
  • 2012On revenue in the generalized second price auction83 cited
  • 2011Bayesian Combinatorial Auctions: Expanding Single Buyer Mechanisms to Many Buyers64 cited
  • 2008Posted prices vs. negotiations58 cited
  • 2020Dynamic Pricing (and Assortment) Under a Static Calendar49 cited
  • 2009Mechanisms for Making Crowds Truthful

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

41 cited