Robust bilateral trade with discrete types

Simple item page
buir.contributor.authorKargar, Kamyar
buir.contributor.authorBayrak, Halil İbrahim
buir.contributor.authorPınar, Mustafa Çelebi
dc.citation.epage393en_US
dc.citation.issueNumber4en_US
dc.citation.spage367en_US
dc.citation.volumeNumber6en_US
dc.contributor.authorKargar, Kamyaren_US
dc.contributor.authorBayrak, Halil İbrahimen_US
dc.contributor.authorPınar, Mustafa Çelebien_US
dc.date.accessioned2019-02-21T16:01:21Z
dc.date.available2019-02-21T16:01:21Z
dc.date.issued2018en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractBilateral 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.
dc.description.provenanceMade available in DSpace on 2019-02-21T16:01:21Z (GMT). No. of bitstreams: 1 Bilkent-research-paper.pdf: 222869 bytes, checksum: 842af2b9bd649e7f548593affdbafbb3 (MD5) Previous issue date: 2018en
dc.identifier.doi10.1007/s13675-018-0106-x
dc.identifier.issn2192-4406
dc.identifier.urihttp://hdl.handle.net/11693/49823
dc.language.isoEnglish
dc.publisherSpringer
dc.relation.isversionofhttps://doi.org/10.1007/s13675-018-0106-x
dc.source.titleEURO Journal on Computational Optimizationen_US
dc.subjectAmbiguityen_US
dc.subjectMechanism designen_US
dc.subjectRobustnessen_US
dc.subjectϕ-Divergenceen_US
dc.titleRobust bilateral trade with discrete typesen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Robust_bilateral_trade_with_discrete_types.pdf
Size:
663.42 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Department of Industrial Engineering