Truthfulness in advertising? Approximation mechanisms for knapsack bidders
From MaRDI portal
Publication:1651735
DOI10.1016/j.ejor.2018.04.001zbMath1403.90564OpenAlexW2795845210MaRDI QIDQ1651735
Martin Bichler, Soeren Merting
Publication date: 12 July 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.04.001
Combinatorial optimization (90C27) Auctions, bargaining, bidding and selling, and other market models (91B26)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient multi-item dynamic auction with budget constrained bidders
- Efficiency and strategy-proofness in object assignment problems with multi-demand preferences
- Multi-unit auctions with budget limits
- Strategy-proof, efficient, and nonbossy quota allocations
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- An approximation algorithm for the generalized assignment problem
- Approximately competitive equilibria in large finite economies
- Generalized assignment problem: truthful mechanism design without money
- Truthfulness with value-maximizing bidders: on the limits of approximation in combinatorial markets
- Strategy-proof allocation of indivisible goods
- Coalitional strategy-proof and resource-monotonic solutions for multiple assignment problems
- Truthfulness and Approximation with Value-Maximizing Bidders
- Position Auctions with Budgets: Existence and Uniqueness
- Randomized metarounding (extended abstract)
- The Incentives for Price-Taking Behavior in Large Exchange Economies
- Manipulation of Voting Schemes: A General Result
- Manipulation of Schemes that Mix Voting with Chance
- Auction design without quasilinear preferences
- Truthful Generalized Assignments via Stable Matching
- An Introduction to the Theory of Mechanism Design
- Truthful and Near-Optimal Mechanism Design via Linear Programming
- Algorithmic Game Theory
- A Truthful Mechanism for Offline Ad Slot Scheduling
- College Admissions and the Stability of Marriage
This page was built for publication: Truthfulness in advertising? Approximation mechanisms for knapsack bidders