Better redistribution with inefficient allocation in multi-unit auctions with unit demand

No abstract is available for this paper.

• Publication year

  2008

• Venue

  ACM Conference on Economics and Computation

• Publication date

  2008-07-08

• Fields of study

  Computer Science, Economics

• Identifiers
  DOI 10.1145/1386790.1386825
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Redistribution Mechanisms for the Assignment of Heterogeneous Objects

  2011cited by this paper
• Worst-case optimal redistribution of VCG payments in multi-unit auctions

  2009influential reference
• Almost budget-balanced VCG mechanisms to assign multiple objects

  2009influential reference
• Optimal-in-expectation redistribution mechanisms

  2008cited by this paper
• Undominated VCG redistribution mechanisms

  2008cited by this paper
• E ffi cient , strategy-proof and almost budget-balanced assignment

  2007influential reference
• Worst-case optimal redistribution of VCG payments

  2007cited by this paper
• Optimal decision-making with minimal waste: strategyproof redistribution of VCG payments

  2006cited by this paper
• From optimal limited to unlimited supply auctions

  2005cited by this paper
• Derandomization of auctions

  2005cited by this paper
• Mechanism design via machine learning

  2005cited by this paper
• A budget-balanced, incentive-compatible scheme for social choice

  2004cited by this paper
• Competitive Auctions

  2002cited by this paper
• Achieving Budget-Balance with Vickrey-Based Payment Schemes in Exchanges

  2001cited by this paper
• Sharing the Cost of Multicast Transmissions

  2001cited by this paper
• Sharing the cost of muliticast transmissions (preliminary version)

  2000cited by this paper
• Computationally feasible VCG mechanisms

  2000cited by this paper
• The demand revealing process: To distribute the surplus

  1997cited by this paper
• Efficient Mechanisms for Bilateral Trading

  1983cited by this paper
• Incentives in public decision-making

  1980cited by this paper
• GROVES' SCHEME ON RESTRICTED DOMAINS

  1979cited by this paper
• Characterization of Satisfactory Mechanisms for the Revelation of Preferences for Public Goods

  1977cited by this paper
• Incentives in Teams

  1973cited by this paper
• Multipart pricing of public goods

  1971cited by this paper
• Counterspeculation, Auctions, And Competitive Sealed Tenders

  1961cited by this paper
• Optimization of Payments in Dominant Strategy Mechanisms for Single-Parameter Domains 1

  year unknowncited by this paper

• An Interpretable Automated Mechanism Design Framework with Large Language Models

  2025influential citation
• Designing Redistribution Mechanisms for Reducing Transaction Fees in Blockchains

  2024cites this paper
• Withholding and damage in Bayesian trade mechanisms

  2023cites this paper
• Learning Optimal Redistribution Mechanisms through Neural Networks

  2018cites this paper
• Optimal Strategy-Proof and Budget Balanced Mechanisms to Assign Multiple Objects

  2016influential citation
• Essays on robust mechanism design

  2016influential citation
• Maximizing social welfare in congestion games via redistribution

  2015cites this paper
• Increasing VCG Revenue by Decreasing the Quality of Items

  2014cites this paper
• Exploring Domain Auction and Priority Checking Analysis

  2014cites this paper
• Five Essays in Economic Theory

  2014cites this paper
• Destroy to save

  2014cites this paper
• Five Essays in Economic Theory

  2014cites this paper
• Optimal false-name-proof single-item redistribution mechanisms

  2014cites this paper
• Redistribution in online mechanisms

  2013cites this paper
• Optimal payments in dominant-strategy mechanisms for single-parameter domains

  2013cites this paper
• Stochastic Mechanisms for Truthfulness and Budget Balance in Computational Social Choice

  2013cites this paper
• Generalized Partition Mechanism: Framework for Combining Multiple Strategy-Proof Mechanisms

  2012cites this paper
• Undominated Groves Mechanisms

  2012cites this paper
• VCG Redistribution with Gross Substitutes

  2011cites this paper
• A Convex Optimization Framework for Almost Budget Balanced Allocation of a Divisible Good

  2011cites this paper
• Strategy-proof redistribution mechanisms for budget constrained bidders

  2011cites this paper
• Redistribution Mechanisms for the Assignment of Heterogeneous Objects

  2011influential citation
• Budget-Balanced and Nearly Efficient Randomized Mechanisms: Public Goods and beyond

  2011cites this paper
• Computationally Feasible Approaches to Automated Mechanism Design

  2010cites this paper
• An efficient and almost budget balanced cost sharing method

  2010cites this paper
• Comparing multiagent systems research in combinatorial auctions and voting

  2010cites this paper
• Novel Mechanisms For Allocation Of Heterogeneous Items In Strategic Settings

  2010cites this paper
• Intellectual development statement

  2010cites this paper
• Computationally Feasible Automated Mechanism Design: General Approach and Case Studies

  2010influential citation
• Strategy-proof allocation of multiple items between two agents without payments or priors

  2010cites this paper
• Sequential partition mechanism for strongly budget-balanced redistribution

  2009cites this paper
• Competitive Repeated Allocation without Payments

  2009cites this paper
• Sequential Bidding in the Bailey-Cavallo Mechanism

  2009cites this paper
• Destroy to save

  2009influential citation
• Redistribution of VCG Payments in Assignment of Heterogeneous Objects

  2008influential citation
• Optimal-in-expectation redistribution mechanisms

  2008cites this paper
• Welfare Undominated Groves Mechanisms

  2008cites this paper