Home > Research > Publications & Outputs > Robust bilateral trade with discrete types

Links

Text available via DOI:

View graph of relations

Robust bilateral trade with discrete types

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Robust bilateral trade with discrete types. / Kargar, Kamyar; Bayrak, Halil Ibrahim; Pinar, Mustafa Çelebi.
In: EURO Journal on Computational Optimization, Vol. 6, No. 4, 31.12.2018, p. 367-393.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Kargar, K, Bayrak, HI & Pinar, MÇ 2018, 'Robust bilateral trade with discrete types', EURO Journal on Computational Optimization, vol. 6, no. 4, pp. 367-393. https://doi.org/10.1007/s13675-018-0106-x

APA

Kargar, K., Bayrak, H. I., & Pinar, M. Ç. (2018). Robust bilateral trade with discrete types. EURO Journal on Computational Optimization, 6(4), 367-393. https://doi.org/10.1007/s13675-018-0106-x

Vancouver

Kargar K, Bayrak HI, Pinar MÇ. Robust bilateral trade with discrete types. EURO Journal on Computational Optimization. 2018 Dec 31;6(4):367-393. doi: 10.1007/s13675-018-0106-x

Author

Kargar, Kamyar ; Bayrak, Halil Ibrahim ; Pinar, Mustafa Çelebi. / Robust bilateral trade with discrete types. In: EURO Journal on Computational Optimization. 2018 ; Vol. 6, No. 4. pp. 367-393.

Bibtex

@article{b0dec1b42c9a462d9056daf12cc84b81,
title = "Robust bilateral trade with discrete types",
abstract = "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 property—Allocation Maximality—and 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{\textquoteright} 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.",
keywords = "Ambiguity, Mechanism design, Robustness, ϕ-Divergence",
author = "Kamyar Kargar and Bayrak, {Halil Ibrahim} and Pinar, {Mustafa {\c C}elebi}",
note = "Publisher Copyright: {\textcopyright} 2018, Springer-Verlag GmbH Germany, part of Springer Nature and EURO - The Association of European Operational Research Societies.",
year = "2018",
month = dec,
day = "31",
doi = "10.1007/s13675-018-0106-x",
language = "English",
volume = "6",
pages = "367--393",
journal = "EURO Journal on Computational Optimization",
issn = "2192-4406",
publisher = "Springer Verlag",
number = "4",

}

RIS

TY - JOUR

T1 - Robust bilateral trade with discrete types

AU - Kargar, Kamyar

AU - Bayrak, Halil Ibrahim

AU - Pinar, Mustafa Çelebi

N1 - Publisher Copyright: © 2018, Springer-Verlag GmbH Germany, part of Springer Nature and EURO - The Association of European Operational Research Societies.

PY - 2018/12/31

Y1 - 2018/12/31

N2 - 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 property—Allocation Maximality—and 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.

AB - 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 property—Allocation Maximality—and 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.

KW - Ambiguity

KW - Mechanism design

KW - Robustness

KW - ϕ-Divergence

U2 - 10.1007/s13675-018-0106-x

DO - 10.1007/s13675-018-0106-x

M3 - Journal article

AN - SCOPUS:85053189820

VL - 6

SP - 367

EP - 393

JO - EURO Journal on Computational Optimization

JF - EURO Journal on Computational Optimization

SN - 2192-4406

IS - 4

ER -