Mechanism Design Under Approximate Incentive Compatibility

@article{Balseiro2021MechanismDU,
  title={Mechanism Design Under Approximate Incentive Compatibility},
  author={Santiago R. Balseiro and Omar Besbes and Francisco Castro},
  journal={Operations Research},
  year={2021}
}
An assumption that is pervasive in revenue management and economics is that buyers are perfect optimizers. However, in practice, buyers may be limited by their computational capabilities or lack of information and may not be able to perfectly optimize their response to a selling mechanism. This has motivated the introduction of approximate incentive compatibility as a solution concept for practical mechanisms. In “Mechanism Design under Approximate Incentive Compatibility,” Balseiro, Besbes… 

Figures from this paper

References

SHOWING 1-10 OF 38 REFERENCES

Optimal Selling Strategies: When to Haggle, When to Hold Firm

A seller encountering risk-neutral buyers one at a time should, if commitments are feasible, quote a single take-it-or-leave-it price to each. This strategy is superior to any other for finite or

Strategy-Proofness in the Large

We propose a criterion of approximate incentive compatibility, strategy-proofness in the large (SP-L), and argue that it is a useful second-best to exact strategy-proofness (SP) for market design.

Dynamic Mechanism Design with Budget Constrained Buyers under Limited Commitment

It is shown that the celebrated Myersonian approach that leverages the envelope theorem fails in this setting, and therefore, characterizing the dynamic optimal mechanism appears intractable.

Bernoulli Factories and Black-box Reductions in Mechanism Design

A polynomial time reduction from Bayesian incentive compatible mechanism design to Bayesian algorithm design for welfare maximization problems and achieves exact incentive compatibility for problems with multi-dimensional and continuous type spaces.

Welfare-Preserving ε-BIC to BIC Transformation with Negligible Revenue Loss

This paper investigates the problem of transforming an $\varepsilon$-BIC mechanism into an exactly BIC mechanism without loss of social welfare, working in a general mechanism design setting and provides the first welfare-preserving transformation that preserves welfare and provides negligible revenue loss.

A Data-Driven Metric of Incentive Compatibility

This work introduces a new metric to quantify incentive compatibility in both static and dynamic environments and proves that it is monotone in auction parameters for several mechanisms used in practice, such as soft floors and dynamic reserve prices.

The Complexity of Contracts

It is shown that simple linear δ-IC contracts with constant δ are sufficient to achieve a constant-factor approximation of the “first-best” (full-welfare-extracting) solution, and that such a contract can be computed in polynomial time.

An Efficient ε-BIC to BIC Transformation and Its Application to Black-Box Reduction in Revenue Maximization

A new polynomial time transformation is provided that converts any ε-BIC mechanism to an exactly BIC mechanism with only a negligible revenue loss and a new algorithm is developed that can accommodate arbitrary edge weights.

Envy, Regret, and Social Welfare Loss

The theoretical results are completed showing that, in the position auction environment, IC-Envy can be used to bound the loss in social welfare due to the advertiser untruthful behavior and experimentally it is shown that IC-envy can been used as a feature to predict IC-Regret in settings not covered by the theoretical results.

Testing Dynamic Incentive Compatibility in Display Ad Auctions

This paper takes the perspective of a single advertiser and develops statistical tests to confirm whether an underlying auction mechanism is dynamically incentive compatible (IC), so that truthful bidding in each individual auction and across time is an optimal strategy.