Dynamic Pricing with a Prior on Market Response

We study a problem of dynamic pricing faced by a vendor with limited inventory, uncertain about demand, aiming to maximize expected discounted revenue over an infinite time horizon. The vendor learns from purchase data, so his strategy must take into account the impact of price on both revenue and future observations. We focus on a model in which customers arrive according to a Poisson process of uncertain rate, each with an independent, identically distributed reservation price. Upon arrival, a customer purchases a unit of inventory if and only if his reservation price equals or exceeds the vendor’s prevailing price.Institute for Operations Research and the Management Sciences (MSOM society)National Science Foundation (U.S.) (grant IIS- 0428868

Quantifying signals with power-law correlations: A comparative study of detrended fluctuation analysis and detrended moving average techniques

Detrended fluctuation analysis (DFA) and detrended moving average (DMA) are two scaling analysis methods designed to quantify correlations in noisy non-stationary signals. We systematically study the performance of different variants of the DMA method when applied to artificially generated long-range power-law correlated signals with an {\it a-priori} known scaling exponent $\alpha_{0}$ and compare them with the DFA method. We find that the scaling results obtained from different variants of the DMA method strongly depend on the type of the moving average filter. Further, we investigate the optimal scaling regime where the DFA and DMA methods accurately quantify the scaling exponent $\alpha_{0}$, and how this regime depends on the correlations in the signal. Finally, we develop a three-dimensional representation to determine how the stability of the scaling curves obtained from the DFA and DMA methods depends on the scale of analysis, the order of detrending, and the order of the moving average we use, as well as on the type of correlations in the signal.Comment: 15 pages, 16 figure

Assortment optimisation under a general discrete choice model: A tight analysis of revenue-ordered assortments

The assortment problem in revenue management is the problem of deciding which subset of products to offer to consumers in order to maximise revenue. A simple and natural strategy is to select the best assortment out of all those that are constructed by fixing a threshold revenue $\pi$ and then choosing all products with revenue at least $\pi$. This is known as the revenue-ordered assortments strategy. In this paper we study the approximation guarantees provided by revenue-ordered assortments when customers are rational in the following sense: the probability of selecting a specific product from the set being offered cannot increase if the set is enlarged. This rationality assumption, known as regularity, is satisfied by almost all discrete choice models considered in the revenue management and choice theory literature, and in particular by random utility models. The bounds we obtain are tight and improve on recent results in that direction, such as for the Mixed Multinomial Logit model by Rusmevichientong et al. (2014). An appealing feature of our analysis is its simplicity, as it relies only on the regularity condition. We also draw a connection between assortment optimisation and two pricing problems called unit demand envy-free pricing and Stackelberg minimum spanning tree: These problems can be restated as assortment problems under discrete choice models satisfying the regularity condition, and moreover revenue-ordered assortments correspond then to the well-studied uniform pricing heuristic. When specialised to that setting, the general bounds we establish for revenue-ordered assortments match and unify the best known results on uniform pricing.Comment: Minor changes following referees' comment

One-step Multiplex Transgenesis via Sleeping Beauty Transposition in Cattle

Genetically modified cattle are important for developing new biomedical models and for an improved understanding of the pathophysiology of zoonotic diseases. However, genome editing and genetic engineering based on somatic cell nuclear transfer suffer from a low overall efficiency. Here, we established a highly efficient one-step multiplex gene transfer system into the bovine genome.Fil: Garrels, Wiebke. Institut für Nutztiergenetik; AlemaniaFil: Talluri, Thirumala R.. Institut für Nutztiergenetik; AlemaniaFil: Apfelbaum, Ronja. Institut für Nutztiergenetik; AlemaniaFil: Carratalá, Yanet P.. Institut für Nutztiergenetik; AlemaniaFil: Bosch, Pablo. Universidad Nacional de Río Cuarto. Facultad de Ciencias Exactas Fisicoquímicas y Naturales. Departamento de Biología Molecular; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba; ArgentinaFil: Pötzsch, Kerstin. Paul Ehrlich Institute; AlemaniaFil: Grueso, Esther. Paul Ehrlich Institute; AlemaniaFil: Ivics, Zoltan. Paul Ehrlich Institute; AlemaniaFil: Kues, Wilfred. Institut für Nutztiergenetik; Alemani

Confidence-based integrated reweighting model of task-difficulty explains location-based specificity in perceptual learning

Perceptual learning is classically thought to be highly specific to the trained stimuli's retinal locations. However, recent research using a novel double-training paradigm has found dramatic transfer of perceptual learning to untrained locations. These results challenged existing models of perceptual learning and provoked intense debate in the field. Recently, Hung and Seitz (2014) showed that previously reported results could be reconciled by considering the details of the training procedure, in particular, whether it involves prolonged training at threshold using a single staircase procedure or multiple staircases. Here, we examine a hierarchical neural network model of the visual pathway, built upon previously proposed integrated reweighting models of perceptual learning, to understand how retinotopic transfer depends on the training procedure adopted. We propose that the transfer and specificity of learning between retinal locations can be explained by considering the task-difficulty and confidence during training. In our model, difficult tasks lead to higher learning of weights from early visual cortex to the decision unit, and thus to specificity, while easy tasks lead to higher learning of weights from later stages of the visual hierarchy and thus to more transfer. To model interindividual difference in task-difficulty, we relate task-difficulty to the confidence of subjects. We show that our confidence-based reweighting model can account for the results of Hung and Seitz (2014) and makes testable predictions

Occurrence of testicular microlithiasis in androgen insensitive hypogonadal mice

<b>Background</b>: Testicular microliths are calcifications found within the seminiferous tubules. In humans, testicular microlithiasis (TM) has an unknown etiology but may be significantly associated with testicular germ cell tumors. Factors inducing microlith development may also, therefore, act as susceptibility factors for malignant testicular conditions. Studies to identify the mechanisms of microlith development have been hampered by the lack of suitable animal models for TM.<BR/> <b>Methods</b>: This was an observational study of the testicular phenotype of different mouse models. The mouse models were: cryptorchid mice, mice lacking androgen receptors (ARs) on the Sertoli cells (SCARKO), mice with a ubiquitous loss of androgen ARs (ARKO), hypogonadal (hpg) mice which lack circulating gonadotrophins, and hpg mice crossed with SCARKO (hpg.SCARKO) and ARKO (hpg.ARKO) mice.<BR/> <b>Results</b>: Microscopic TM was seen in 94% of hpg.ARKO mice (n=16) and the mean number of microliths per testis was 81 +/- 54. Occasional small microliths were seen in 36% (n=11) of hpg testes (mean 2 +/- 0.5 per testis) and 30% (n=10) of hpg.SCARKO testes (mean 8 +/- 6 per testis). No microliths were seen in cryptorchid, ARKO or SCARKO mice. There was no significant effect of FSH or androgen on TM in hpg.ARKO mice.<BR/> <b>Conclusions</b>: We have identified a mouse model of TM and show that lack of endocrine stimulation is a cause of TM. Importantly, this model will provide a means with which to identify the mechanisms of TM development and the underlying changes in protein and gene expression

Some reproductive parameters of Zanskari mares reared in an organized farm under tropical climate

The present study was undertaken to record the data on duration of estrus, estrus cycle length, size of the follicle at ovulation, period of gestation and estrus after foaling (foal heat) in respect of Zanskari mares for 4 consecutive breeding seasons (2010–2014). The mares were closely monitored with transrectal ultrasonography for their follicle size variation and to determine size of the follicle at ovulation. The mares were inseminated with frozen thawed semen from Zanskari stallions. This is the first time ever that Zanskari stallion semen was cryopreserved successfully and viable foals were produced by using frozen semen via artificial insemination. The reproductive parameters of the mares of Zanskari breed in India are poorly investigated and thus no reports are available on reproductive characteristics of Zanskari breed till today in the literature. Our results can be useful as a ready reference for some of the reproductive characteristics and traits of Zanskari breed as well as indigenous horses reared under tropical region. The reproductive parameters analysed in the present study are fitting within the characteristics of the other Indian horse breeds reared under this region and the differences may be caused by breed effect and other environmental factors

Establishment of cell-based transposon-mediated transgenesis in cattle

Transposon-mediated transgenesis is a well-established tool for genome modification in small animal models. However, translation of this active transgenic method to large animals warrants further investigations. Here, the piggyBac (PB) and sleeping beauty (SB) transposon systems were assessed for stable gene transfer into the cattle genome. Bovine fibroblasts were transfected either with a helper-independent PB system or a binary SB system. Both transposons were highly active in bovine cells increasing the efficiency of DNA integration up to 88 times over basal nonfacilitated integrations in a colony formation assay. SB transposase catalyzed multiplex transgene integrations in fibroblast cells transfected with the helper vector and two donor vectors carrying different transgenes (fluorophore and neomycin resistance). Stably transfected fibroblasts were used for SCNT and on in vitro embryo culture, morphologically normal blastocysts that expressed the fluorophore were obtained with both transposon systems. The data indicate that transpositionis a feasible approach for genetic engineering in the cattle genome.Fil: Alessio, Ana Paula. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Parque Centenario; Argentina. Universidad Nacional de Río Cuarto. Facultad de Ciencias Exactas Fisicoquímicas y Naturales. Departamento de Biología Molecular; ArgentinaFil: Fili, Alejandro. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Parque Centenario; Argentina. Universidad Nacional de Río Cuarto. Facultad de Ciencias Exactas Fisicoquímicas y Naturales. Departamento de Biología Molecular; ArgentinaFil: Garrels, Wiebke. Institut für Nutztiergenetik; Alemania. Gottfried Wilhelm Leibniz Universität Hannover; AlemaniaFil: Forcato, Diego Oscar. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Parque Centenario; Argentina. Universidad Nacional de Río Cuarto. Facultad de Ciencias Exactas Fisicoquímicas y Naturales. Departamento de Biología Molecular; ArgentinaFil: Olmos Nicotra, Maria Florencia. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Parque Centenario; Argentina. Universidad Nacional de Río Cuarto. Facultad de Ciencias Exactas Fisicoquímicas y Naturales. Departamento de Biología Molecular; ArgentinaFil: Liaudat, Ana Cecilia. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Parque Centenario; Argentina. Universidad Nacional de Río Cuarto. Facultad de Ciencias Exactas Fisicoquímicas y Naturales. Departamento de Biología Molecular; ArgentinaFil: Bevacqua, Romina Jimena. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Parque Centenario; Argentina. Universidad de Buenos Aires. Facultad de Agronomía. Pabellón de Zootecnica. Laboratorio de Biotecnología Animal; ArgentinaFil: Savy, Virginia. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Parque Centenario; Argentina. Universidad de Buenos Aires. Facultad de Agronomía. Pabellón de Zootecnica. Laboratorio de Biotecnología Animal; ArgentinaFil: Hiriart, María Inés. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Parque Centenario; Argentina. Universidad de Buenos Aires. Facultad de Agronomía. Pabellón de Zootecnica. Laboratorio de Biotecnología Animal; ArgentinaFil: Talluri, Thirumala R.. Institut für Nutztiergenetik; AlemaniaFil: Owens, Jesse B.. University of Hawaii at Manoa; Estados UnidosFil: Ivics, Zoltán. Paul-Ehrlich-Institute; AlemaniaFil: Salamone, Daniel Felipe. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Parque Centenario; Argentina. Universidad de Buenos Aires. Facultad de Agronomía. Pabellón de Zootecnica. Laboratorio de Biotecnología Animal; ArgentinaFil: Moisyadi, Stefan. University of Hawaii at Manoa; Estados UnidosFil: Kues, Wilfried A.. Institut für Nutztiergenetik; AlemaniaFil: Bosch, Pablo. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Parque Centenario; Argentina. Universidad Nacional de Río Cuarto. Facultad de Ciencias Exactas Fisicoquímicas y Naturales. Departamento de Biología Molecular; Argentin

A branch and efficiency algorithm for the optimal design of supply chain networks

Supply chain operations directly affect service levels. Decision on amendment of facilities is generally decided based on overall cost, leaving out the efficiency of each unit. Decomposing the supply chain superstructure, efficiency analysis of the facilities (warehouses or distribution centers) that serve customers can be easily implemented. With the proposed algorithm, the selection of a facility is based on service level maximization and not just cost minimization as this analysis filters all the feasible solutions utilizing Data Envelopment Analysis (DEA) technique. Through multiple iterations, solutions are filtered via DEA and only the efficient ones are selected leading to cost minimization. In this work, the problem of optimal supply chain networks design is addressed based on a DEA based algorithm. A Branch and Efficiency (B&E) algorithm is deployed for the solution of this problem. Based on this DEA approach, each solution (potentially installed warehouse, plant etc) is treated as a Decision Making Unit, thus is characterized by inputs and outputs. The algorithm through additional constraints named “efficiency cuts”, selects only efficient solutions providing better objective function values. The applicability of the proposed algorithm is demonstrated through illustrative examples