scientific article; zbMATH DE number 7053320
From MaRDI portal
Publication:5743441
zbMath1425.91206MaRDI QIDQ5743441
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095184
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (2)
Uniform price auctions: equilibria and efficiency ⋮ A universally-truthful approximation scheme for multi-unit auctions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Limitations of VCG-based mechanisms
- Truthful approximation mechanisms for restricted combinatorial auctions
- Algorithmic mechanism design (extended abstract)
- Discrete Dynamic Programming and Capital Allocation
- Approximation techniques for utilitarian mechanism design
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- On the Power of Randomization in Algorithmic Mechanism Design
- Mechanisms for Multi-Unit Auctions
- Truthful and Near-Optimal Mechanism Design via Linear Programming
- Black-Box Randomized Reductions in Algorithmic Mechanism Design
- The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
- Truthful randomized mechanisms for combinatorial auctions
- Random knapsack in expected polynomial time
This page was built for publication:
