An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents
From MaRDI portal
(Redirected from Publication:4665444)
Recommendations
Cited in
(47)- Maximizing the minimum load for selfish agents
- Truthfulness in advertising? Approximation mechanisms for knapsack bidders
- A universally-truthful approximation scheme for multi-unit auctions
- Truthfulness with value-maximizing bidders: on the limits of approximation in combinatorial markets
- On social envy-freeness in multi-unit markets
- Incentive compatible mulit-unit combinatorial auctions: a primal dual approach
- Limitations of VCG-based mechanisms
- Bayesian incentive compatibility via matchings
- Truthful approximation mechanisms for restricted combinatorial auctions
- A generic truthful mechanism for combinatorial auctions
- Truthful mechanisms with implicit payment computation
- Truthfulness and approximation with value-maximizing bidders
- Bayesian algorithmic mechanism design
- Single-parameter combinatorial auctions with partially public valuations
- Randomized mechanisms for multi-unit auctions (extended abstract)
- Online mechanism design (randomized rounding on the fly)
- Mechanisms for multi-unit combinatorial auctions with a few distinct goods
- Approximation techniques for utilitarian mechanism design
- Approximate composable truthful mechanism design
- Single-value combinatorial auctions and algorithmic implementation in undominated strategies
- Truth revelation in approximately efficient combinatorial auctions
- Combinatorial auctions with conflict-based externalities
- Computationally efficient approximation mechanisms
- Approximation techniques for utilitarian mechanism design
- On the limitations of greedy mechanism design for truthful combinatorial auctions
- Two Randomized Mechanisms for Combinatorial Auctions
- Computationally feasible VCG mechanisms
- Truthful Mechanisms via Greedy Iterative Packing
- scientific article; zbMATH DE number 1947375 (Why is no real title available?)
- scientific article; zbMATH DE number 2079341 (Why is no real title available?)
- Stepwise randomized combinatorial auctions achieve revenue monotonicity
- Efficient money burning in general domains
- Mechanisms for multi-unit auctions
- Combinatorial auctions without money
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Price of anarchy for greedy auctions
- scientific article; zbMATH DE number 7053320 (Why is no real title available?)
- Truthful randomized mechanisms for combinatorial auctions
- Truthful randomized mechanisms for combinatorial auctions
- Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
- SOFSEM 2004: Theory and Practice of Computer Science
- Explicitly simple near-tie auctions
- Expressive markets for donating to charities
- Algorithmic mechanism design with investment
- Coordinating monetary contributions in participatory budgeting
- Tight incentive analysis of Sybil attacks against the market equilibrium of resource exchange over general networks
- Computationally-feasible truthful auctions for convex bundles
This page was built for publication: An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4665444)
