1,310 research outputs found

    The Power of Simple Menus in Robust Selling Mechanisms

    Full text link
    We study a robust selling problem where a seller attempts to sell one item to a buyer but is uncertain about the buyer's valuation distribution. Existing literature indicates that robust mechanism design provides a stronger theoretical guarantee than robust deterministic pricing. Meanwhile, the superior performance of robust mechanism design comes at the expense of implementation complexity given that the seller offers a menu with an infinite number of options, each coupled with a lottery and a payment for the buyer's selection. In view of this, the primary focus of our research is to find simple selling mechanisms that can effectively hedge against market ambiguity. We show that a selling mechanism with a small menu size (or limited randomization across a finite number of prices) is already capable of deriving significant benefits achieved by the optimal robust mechanism with infinite options. In particular, we develop a general framework to study the robust selling mechanism problem where the seller only offers a finite number of options in the menu. Then we propose a tractable reformulation that addresses a variety of ambiguity sets of the buyer's valuation distribution. Our formulation further enables us to characterize the optimal selling mechanisms and the corresponding competitive ratio for different menu sizes and various ambiguity sets, including support, mean, and quantile information. In light of the closed-form competitive ratios associated with different menu sizes, we provide managerial implications that incorporating a modest menu size already yields a competitive ratio comparable to the optimal robust mechanism with infinite options, which establishes a favorable trade-off between theoretical performance and implementation simplicity. Remarkably, a menu size of merely two can significantly enhance the competitive ratio, compared to the deterministic pricing scheme

    Several new classes of MDS symbol-pair codes derived from matrix-product codes

    Full text link
    In order to correct the pair-errors generated during the transmission of modern high-density data storage that the outputs of the channels consist of overlapping pairs of symbols, a new coding scheme named symbol-pair code is proposed. The error-correcting capability of the symbol-pair code is determined by its minimum symbol-pair distance. For such codes, the larger the minimum symbol-pair distance, the better. It is a challenging task to construct symbol-pair codes with optimal parameters, especially, maximum-distance-separable (MDS) symbol-pair codes. In this paper, the permutation equivalence codes of matrix-product codes with underlying matrixes of orders 3 and 4 are used to extend the minimum symbol-pair distance, and six new classes of MDS symbol-pair codes are derived.Comment: 22 pages,1 tabl

    Semi-Separable Mechanisms in Multi-Item Robust Screening

    Full text link
    It is generally challenging to characterize the optimal selling mechanism even when the seller knows the buyer's valuation distributions in multi-item screening. An insightful and significant result in robust mechanism design literature is that if the seller knows only marginal distributions of the buyer's valuation, then separable mechanisms, in which all items are sold independently, are robustly optimal under the maximin revenue objectives. While the separable mechanism is simple to implement, the literature also indicates that separate selling can not guarantee any substantial fraction of the potential optimal revenue for given distributions. To design a simple mechanism with a good performance guarantee, we introduce a novel class of mechanisms, termed "semi-separable mechanism". In these mechanisms, the allocation and payment rule of each item is a function solely of the corresponding item's valuation, which retains the separable mechanism's practical simplicity. However, the design of the allocation and payment function is enhanced by leveraging the joint distributional information, thereby improving the performance guarantee against the hindsight optimal revenue. We establish that a semi-separable mechanism achieves the optimal performance ratio among all incentive-compatible and individually rational mechanisms when only marginal support information is known. This result demonstrates that the semi-separable mechanisms ensure both the interpretation and implementation simplicity, and performance superiority. Our framework is also applicable to scenarios where the seller possesses information about the aggregate valuations of product bundles within any given partition of the product set. Furthermore, our results also provide guidelines for the multi-item screening problem with non-standard ambiguity sets

    Traffic Flow and Speed Monitoring Based On Optical Fiber Distributed Acoustic Sensor

    Full text link
    In the realm of intelligent transportation systems, accurate and reliable traffic monitoring is crucial. Traditional devices, such as cameras and lidars, face limitations in adverse weather conditions and complex traffic scenarios, prompting the need for more resilient technologies. This paper presents traffic flow monitoring method using optical fiber-based Distributed Acoustic Sensors (DAS). An innovative vehicle trajectory extraction algorithm is proposed to derive traffic flow statistics. In the processing of optical fiber waterfall diagrams, Butterworth low-pass filter and peaks location search method are employed to determine the entry position of vehicles. Subsequently, line-by-line matching algorithm is proposed to effectively track the trajectories. Experiments were conducted under both real highway and tunnel scenarios, showing that our approach not only extracts vehicle trajectories more accurately than the classical Hough and Radon transform-based methods, but also facilitates the calculation of traffic flow information using the low-cost acoustic sensors. It provides a new reliable means for traffic flow monitoring which can be integrated with existing methods.Comment: 10 pages,23 figures, references adde

    Using Shallow Platform Drilling Technology to Tap the Reserves of the Below Constructed Area of Fuyu Oilfield: Taking Chengping Block 12 as an Example

    Get PDF
    The special geographical conditions in the below constructed area of the surface have caused the poor oil-water well condition, incomplete well patterns, difficult measures for tapping potential, and no effective development of reserves, which have affected the comprehensive adjustment of Fuyu oilfield. In order to solve this problem, the shallow large platform horizontal well technology was studied in Fuyu oilfield by taking Chengping 12 reservoir as an example. This technology has been successfully applied under limited ground conditions, and underground reserves have been fully utilized. This study has laid a solid foundation for fuyu oilfield to increase recoverable reserves and achieve stable production during the 12th Five-year plan

    Identification of Apo-A1 as a biomarker for early diagnosis of bladder transitional cell carcinoma

    Get PDF
    <p>Abstract</p> <p>Background</p> <p>Bladder transitional cell carcinoma (BTCC) is the fourth most frequent neoplasia in men, clinically characterized by high recurrent rates and poor prognosis. Availability of urinary tumor biomarkers represents a convenient alternative for early detection and disease surveillance because of its direct contact with the tumor and sample accessibility.</p> <p>Results</p> <p>We tested urine samples from healthy volunteers and patients with low malignant or aggressive BTCC to identify potential biomarkers for early detection of BTCC by two-dimensional electrophoresis (2-DE) coupled with mass spectrometry (MS) and bioinformatics analysis. We observed increased expression of five proteins, including fibrinogen (Fb), lactate dehydrogenase B (LDHB), apolipoprotein-A1 (Apo-A1), clusterin (CLU) and haptoglobin (Hp), which were increased in urine samples of patients with low malignant or aggressive bladder cancer. Further analysis of urine samples of aggressive BTCC showed significant increase in Apo-A1 expression compared to low malignant BTCC. Apo-A1 level was measured quantitatively using enzyme-linked immunosorbent assay (ELISA) and was suggested to provide diagnostic utility to distinguish patients with bladder cancer from controls at 18.22 ng/ml, and distinguish patients with low malignant BTCC from patients with aggressive BTCC in two-tie grading system at 29.86 ng/ml respectively. Further validation assay showed that Apo-A1 could be used as a biomarker to diagnosis BTCC with a sensitivity and specificity of 91.6% and 85.7% respectively, and classify BTCC in two-tie grading system with a sensitivity and specificity of 83.7% and 89.7% respectively.</p> <p>Conclusion</p> <p>Taken together, our findings suggest Apo-A1 could be a potential biomarker related with early diagnosis and classification in two-tie grading system for bladder cancer.</p
    corecore