Algorithmic mechanism design with investment
From MaRDI portal
Publication:6536779
Recommendations
Cites work
- scientific article; zbMATH DE number 5787962 (Why is no real title available?)
- Algorithm for optimal winner determination in combinatorial auctions
- Algorithmic mechanism design (extended abstract)
- An ascending Vickrey auction for selling bases of a matroid
- Approximation techniques for utilitarian mechanism design
- Bernoulli factories and black-box reductions in mechanism design
- Bundling equilibrium in combinatorial auctions
- Computational Complexity
- Computationally feasible VCG mechanisms
- Contractual Solutions to the Hold-Up Problem
- Discrete-variable extremum problems
- Efficient investments in the implementation problem
- Envelope Theorems for Arbitrary Choice Sets
- Handbook of combinatorial optimization. In 5 volumes
- Information Acquisition and Efficient Mechanism Design
- Investment Incentives in Procurement Auctions
- Reducibility among combinatorial problems
- Strong NP-hardness of AC power flows feasibility
- The design of approximation algorithms
- Truth revelation in approximately efficient combinatorial auctions
- Truthful approximation mechanisms for restricted combinatorial auctions
- Weak Monotonicity Characterizes Deterministic Dominant-Strategy Implementation
This page was built for publication: Algorithmic mechanism design with investment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536779)