Truth revelation in approximately efficient combinatorial auctions
From MaRDI portal
Recommendations
- Computationally feasible VCG mechanisms
- Truthful approximation mechanisms for restricted combinatorial auctions
- An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents
- scientific article; zbMATH DE number 2079341
- Truthful randomized mechanisms for combinatorial auctions
Cited in
(91)- Thirteen Reasons Why the Vickrey-Clarke-Groves Process Is Not Practical
- Welfare maximization with deferred acceptance auctions in reallocation problems
- Introduction to the special issue -- Algorithmic game theory -- STOC/FOCS/SODA 2011
- Incentive compatible mulit-unit combinatorial auctions: a primal dual approach
- Incentives in core-selecting auctions with single-minded bidders
- Strategyproof auction mechanisms for network procurement
- Characterizing incentive compatible, Pareto optimal and sufficiently anonymous constrained combinatorial mechanisms -- two players case
- Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions
- Combinatorial Walrasian equilibrium
- Truthful mechanism design for multidimensional scheduling via cycle monotonicity
- A combinatorial double auction resource allocation model in cloud computing
- A universally-truthful approximation scheme for multi-unit auctions
- Truthful approximation mechanisms for restricted combinatorial auctions
- Towards fast Vickrey pricing using constraint programming
- The incompatibility of Pareto optimality and dominant-strategy incentive compatibility in sufficiently-anonymous budget-constrained quasilinear settings
- A PAC Approach to Application-Specific Algorithm Selection
- Dictatorial mechanisms in constrained combinatorial auctions
- Single-parameter combinatorial auctions with partially public valuations
- Computationally feasible VCG mechanisms
- Leveraging possibilistic beliefs in unrestricted combinatorial auctions
- On improved interval cover mechanisms for crowdsourcing markets
- Separating the communication complexity of truthful and nontruthful algorithms for combinatorial auctions
- A simple and approximately optimal mechanism for a buyer with complements
- Envy-free revenue approximation for asymmetric buyers with budgets
- Approximation in mechanism design with interdependent values
- Incentive compatible regression learning
- Mechanism design for land acquisition
- Smoothed and average-case approximation ratios of mechanisms: beyond the worst-case analysis
- On envy-free revenue approximation for combinatorial buyers with budgets
- Quality of local equilibria in discrete exchange economies
- Towards characterizing the deterministic combinatorial constrained efficient space
- Budget-balanced and strategy-proof auctions for ridesharing
- Cost sharing and strategyproof mechanisms for set cover games
- Limitations of VCG-based mechanisms
- Combinatorial auctions for electronic business
- scientific article; zbMATH DE number 7053320 (Why is no real title available?)
- Comparing multiagent systems research in combinatorial auctions and voting
- Truthfulness with value-maximizing bidders: on the limits of approximation in combinatorial markets
- The communication requirements of efficient allocations and supporting prices
- GreedEx---a scalable clearing mechanism for utility computing
- Two-way greedy: algorithms for imperfect rationality
- On complexity of single-minded auction
- Truthfulness and approximation with value-maximizing bidders
- Optimal shill bidding in the VCG mechanism
- Mechanism design for set cover games with selfish element agents
- Equilibria of greedy combinatorial auctions
- When Analysis Fails: Heuristic Mechanism Design via Self-correcting Procedures
- Obviously strategyproof single-minded combinatorial auctions
- Pareto efficient combinatorial auctions: dichotomous preferences without quasilinearity
- Impossibility Results for Truthful Combinatorial Auctions with Submodular Valuations
- Inapproximability of truthful mechanisms via generalizations of the Vapnik-Chervonenkis dimension
- Spectrum Bidding in Wireless Networks and Related
- Characterization of ex post equilibrium in the VCG combinatorial auctions
- Revenue maximization with a single sample
- Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location
- Distributed fair allocation of indivisible goods
- Approximate composable truthful mechanism design
- Fair by design: multidimensional envy-free mechanisms
- On social envy-freeness in multi-unit markets
- Bounding the payment of approximate truthful mechanisms
- Explicitly simple near-tie auctions
- Market-based pricing in grids: on strategic manipulation and computational cost
- Automated design of revenue-maximizing combinatorial auctions
- Side constraints and non-price attributes in markets
- Combinatorial auctions with decreasing marginal utilities
- Bayesian incentive compatibility via matchings
- Preemptive Scheduling on Selfish Machines
- scientific article; zbMATH DE number 2163018 (Why is no real title available?)
- Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity
- The effect of false-name bids in combinatorial auctions: new fraud in internet auctions.
- The combinatorial world (of auctions) according to GARP
- Characterizing the incentive compatible and Pareto optimal efficiency space for two players, \(k\) items, public budget and quasilinear utilities
- Truthful randomized mechanisms for combinatorial auctions
- Computationally-feasible truthful auctions for convex bundles
- Bundling equilibrium in combinatorial auctions
- Combinatorial Auctions with Verification Are Tractable
- Multilateral deferred-acceptance mechanisms
- Combinatorial auctions with verification are tractable
- scientific article; zbMATH DE number 1966910 (Why is no real title available?)
- Setting lower bounds on truthfulness
- Dynamic communication mechanism design
- Algorithmic mechanism design with investment
- Combinatorial auctions without money
- A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation
- scientific article; zbMATH DE number 1966906 (Why is no real title available?)
- Auction design with costly preference elicitation
- Iterative Dutch combinatorial auctions
- Priority algorithms for graph optimization problems
- Approximate truthful mechanism design for two-dimensional orthogonal knapsack problem
- Truthful mechanism design via correlated tree rounding
- On the Approximability of Combinatorial Exchange Problems
This page was built for publication: Truth revelation in approximately efficient combinatorial auctions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3455542)
