scientific article; zbMATH DE number 2079341
From MaRDI portal
Publication:4471296
Recommendations
- An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents
- Truthful randomized mechanisms for combinatorial auctions
- Truthful randomized mechanisms for combinatorial auctions
- Approximation techniques for utilitarian mechanism design
- Approximation techniques for utilitarian mechanism design
Cited in
(53)- Truthful mechanisms for two-range-values variant of unrelated scheduling
- A lower bound for scheduling mechanisms
- Mechanism design for set cover games with selfish element agents
- A universally-truthful approximation scheme for multi-unit auctions
- On complexity of single-minded auction
- Pricing lotteries
- Combinatorial auctions with verification are tractable
- Truthful approximation mechanisms for restricted combinatorial auctions
- Approximations and auctions for scheduling batches on related machines
- Beyond the worst-case analysis of random priority: smoothed and average-case approximation ratios in mechanism design
- A general impossibility theorem and its application to individual rights
- Truthful mechanisms with implicit payment computation
- Truthfulness and approximation with value-maximizing bidders
- 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
- Spectrum Bidding in Wireless Networks and Related
- Computationally efficient approximation mechanisms
- Approximation techniques for utilitarian mechanism design
- Adaptive Incentive-Compatible Sponsored Search Auction
- Two Randomized Mechanisms for Combinatorial Auctions
- Truthful Mechanisms via Greedy Iterative Packing
- scientific article; zbMATH DE number 1947375 (Why is no real title available?)
- An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents
- Bounding the payment of approximate truthful mechanisms
- Pricing problems with buyer preselection
- Efficient money burning in general domains
- Smoothed and average-case approximation ratios of mechanisms: beyond the worst-case analysis
- Combinatorial auctions without money
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Price of anarchy for greedy auctions
- Preemptive Scheduling on Selfish Machines
- Maximizing the Minimum Load for Selfish Agents
- scientific article; zbMATH DE number 7053320 (Why is no real title available?)
- scientific article; zbMATH DE number 7053323 (Why is no real title available?)
- Truthful randomized mechanisms for combinatorial auctions
- Truthful randomized mechanisms for combinatorial auctions
- Explicitly simple near-tie auctions
- Comparing multiagent systems research in combinatorial auctions and voting
- Expressive markets for donating to charities
- Incentives in dominant resource fair allocation under dynamic demands
- Truthful learning mechanisms for multi-slot sponsored search auctions with externalities
- Computationally-feasible truthful auctions for convex bundles
- A monotone approximation algorithm for scheduling with precedence constraints
- Walrasian equilibrium: Hardness, approximations and tractable instances
- Inapproximability results for combinatorial auctions with submodular utility functions
- Deterministic monotone algorithms for scheduling on related machines
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471296)
