Bayesian Mechanism Design

DOI10.1561/0400000057zbMath1278.68018OpenAlexW4247154108MaRDI QIDQ2872499

Aranyak Mehta

Publication date: 15 January 2014

Published in: Foundations and Trends® in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1561/0400000057

zbMATH Keywords

matchingallocationonline matchingad allocation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Marketing, advertising (90B60) Online algorithms; streaming algorithms (68W27)

Related Items (54)

Minimum Cost Perfect Matching with Delays for Two Sources ⋮ Online maximum matching with recourse ⋮ Minimum cost perfect matching with delays for two sources ⋮ On the quadratic random matching problem in two-dimensional domains ⋮ Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm ⋮ Online total bipartite matching problem ⋮ Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds ⋮ A dynamic learning algorithm for online matching problems with concave returns ⋮ Improved analysis of RANKING for online vertex-weighted bipartite matching in the random order model ⋮ Online spatio-temporal matching in stochastic and dynamic domains ⋮ Greedy Matching in Bipartite Random Graphs ⋮ Prophet Matching with General Arrivals ⋮ An Experimental Study of Algorithms for Online Bipartite Matching ⋮ An optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals ⋮ Accounting for capacity: A real‐time optimization approach to managing observation unit utilization ⋮ Advice complexity of online non-crossing matching ⋮ Dynamic Stochastic Matching Under Limited Time ⋮ Dynamic Relaxations for Online Bipartite Matching ⋮ Online allocation and display ads optimization with surplus supply ⋮ Max-min greedy matching problem: hardness for the adversary and fractional variant ⋮ The Wasserstein distance to the circular law ⋮ Online Edge Coloring via Tree Recurrences and Correlation Decay ⋮ Unnamed Item ⋮ Tighter Bounds for Online Bipartite Matching ⋮ Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios ⋮ Online Maximum Matching with Recourse ⋮ Best fit bin packing with random order revisited ⋮ Online algorithms for maximum cardinality matching with edge arrivals ⋮ Greedy Bipartite Matching in Random Type Poisson Arrival Model ⋮ Unnamed Item ⋮ New online algorithms for story scheduling in web advertising ⋮ Online stochastic matching: new algorithms and bounds ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On conceptually simple algorithms for variants of online bipartite matching ⋮ Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts ⋮ Competitive analysis for two variants of online metric matching problem ⋮ A polyhedral approach to online bipartite matching ⋮ Online submodular maximization: beating 1/2 made simple ⋮ Unnamed Item ⋮ Best Fit Bin Packing with Random Order Revisited ⋮ A stronger impossibility for fully online matching ⋮ Impatient Online Matching ⋮ Stochastic Online Metric Matching ⋮ A \(2/3\)-approximation algorithm for vertex-weighted matching ⋮ Approximation algorithms in combinatorial scientific computing ⋮ Autobidding with constraints ⋮ Mix and match: Markov chains and mixing times for matching in rideshare ⋮ Tractable Equilibria in Sponsored Search with Endogenous Budgets ⋮ Matching While Learning ⋮ Reward maximization in general dynamic matching systems ⋮ Online Algorithms for Maximum Cardinality Matching with Edge Arrivals ⋮ Learn from history for online bipartite matching ⋮ On the Optimal Design of a Bipartite Matching Queueing System

This page was built for publication: Bayesian Mechanism Design