Robust bilateral trade with discrete types

Kargar Mohammadi K., Bayrak H. I., Pinar M. C.

EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION, vol.6, no.4, pp.367-393, 2018 (ESCI) identifier identifier

  • Publication Type: Article / Article
  • Volume: 6 Issue: 4
  • Publication Date: 2018
  • Doi Number: 10.1007/s13675-018-0106-x
  • Journal Indexes: Emerging Sources Citation Index (ESCI), Scopus
  • Page Numbers: pp.367-393
  • Keywords: Mechanism design, Robustness, Ambiguity, phi-Divergence, EFFICIENT MECHANISMS, OPTIMIZATION, AUCTION, DESIGN
  • TED University Affiliated: No


Bilateral trade problem is the most common market interaction in which a seller and a buyer bargain over an indivisible object, and the valuation of each agent about the object is private information. We investigate the cases where mechanisms satisfying Dominant Strategy Incentive Compatibility (DIC) and Ex-post Individual Rationality (EIR) properties can exhibit robust performance in the face of imprecision in prior structure. We start with the general mathematical formulation for the bilateral trade problem with DIC, EIR properties. We derive necessary and sufficient conditions for DIC, EIR mechanisms to be Ex-post efficient at the same time. Then, we define a new propertyAllocation Maximalityand prove that the Posted Price mechanisms are the only mechanisms that satisfy DIC, EIR and Allocation Maximal properties. We also show that Posted Price mechanism is not the only mechanism that satisfies DIC and EIR properties. The last part of the paper introduces different sets of priors for agents' types and consequently allows ambiguity in the problem framework. We derive robust counterparts and solve them numerically for the proposed objective function under box and divergence ambiguity specifications. Results suggest that restricting the feasible set to Posted Price mechanisms can decrease the objective value to different extents depending on the uncertainty set.