Informational Robustness in Intertemporal Pricing

2020 ◽  
Author(s):  
Jonathan Libgober ◽  
Xiaosheng Mu
Keyword(s):  
Arrival Process ◽  
Durable Good ◽  
Worst Case ◽  
New Techniques ◽  
Know How ◽  
Dynamic Monopoly ◽  
Intertemporal Pricing ◽  
The Face ◽  
Arrival Processes ◽  
Constant Prices

Abstract We introduce a robust approach to study dynamic monopoly pricing of a durable good in the face of buyer learning. A buyer receives information about her willingness-to-pay for the seller’s product over time, and decides when to make a one-time purchase. The seller does not know how the buyer learns but commits to a pricing strategy to maximize profits against the worst-case information arrival process. We show that a constant price path delivers the robustly optimal profit, with profit and price both lower than under known values. Thus, under the robust objective, intertemporal incentives do not arise at the optimum, despite the possibility for information arrival to influence the timing of purchases. We delineate whether constant prices remain optimal (or not) when the seller seeks robustness against a subset of information arrival processes. As part of the analysis, we develop new techniques to study dynamic Bayesian persuasion.

Rule Based Classifiers for Suspect Detection from CCTV Footages

2020 ◽  
Vol 13 ◽  
Author(s):  
Sunil Pathak
Keyword(s):  
Answer Sheet ◽  
Normal Activity ◽  
Contact Detection ◽  
Accuracy Rate ◽  
Hand Detection ◽  
Worst Case ◽  
Average Case ◽  
The Face ◽  
Case Simulation ◽  
Material Exchange

Background: The significant work has been present to identify suspects, gathering information and examining any videos from CCTV Footage. This exploration work expects to recognize suspicious exercises, i.e. object trade, passage of another individual, peeping into other's answer sheet and individual trade from the video caught by a reconnaissance camera amid examinations. This requires the procedure of face acknowledgment, hand acknowledgment and distinguishing the contact between the face and hands of a similar individual and that among various people. Methods: Segmented frames has given as input to obtain foreground image with the help of Gaussian filtering and background modeling method. Suh foreground images has given to Activity Recognition model to detect normal activity or suspicious activity. Results: Accuracy rate, Precision and Recall are calculate for activities detection, contact detection for Best Case, Average Case and Worst Case. Simulation results are compare with performance parameter such as Material Exchange, Position Exchange, and Introduction of a new person, Face and Hand Detection and Multi Person Scenario. Conclusion: In this paper, a framework is prepared for suspect detection. This framework will absolutely realize an unrest in the field of security observation in the training area.

scholarly journals Analisis Jejaring Pengurangan Resiko di Kawasan Rawan Bencana (KRB) Gunung Slamet

2017 ◽  
Vol 2 (1) ◽  
pp. 01
Author(s):  
Agus Setio Widodo
Keyword(s):  
Risk Reduction ◽  
Disaster Risk Reduction ◽  
Population Data ◽  
Disaster Risk ◽  
General Tendency ◽  
Know How ◽  
Central Java ◽  
The Face ◽  
Surrounding Areas ◽  
The Impact

Simple observation of events for the disaster in Indonesia is almost always showed the same picture is a condition in which reactive attitude and spontaneous, unplanned as shown by society and government. There is a general tendency that people do not know how to act or addressing disaster. Regional preparedness in the face of natural disasters is very important. Slamet mountain with an altitude of 3,428 meters above sea level is the highest mountain in Central Java and the second highest in Java. Population data in the area of Mount Slamet and surrounding areas are included in Kawasan Rawan Bencana (disaster-prone areas) is approximately 215 953 inhabitants. Seeing the extent of the area affected by the eruption of Mount Slamet threats can not be taken lightly. This study aimed to explore the networking model for effective disaster risk reduction in disaster-prone areas of Mount Slamet. Networking model for disaster risk reduction is a very important information in order to overcome the impact of the eruption of Mount Slamet.

Causality and Filling the Ignorance Gap

2021 ◽  
pp. 163-194
Author(s):  
Sara E. Gorman ◽  
Jack M. Gorman
Keyword(s):  
Psychological Research ◽  
Coping Mechanisms ◽  
Rational Thinking ◽  
Know How ◽  
Cause And Effect ◽  
Hard Time ◽  
Difficult Time ◽  
The Face ◽  
Do So

This chapter evaluates uncertainty and why people feel the need to fill the ignorance gap. The tendency to want to know why things are as they are and figuring out what caused what often leads people to incorrect or even dangerous scientific conclusions. The chapter argues that it is highly adaptive to know how to attribute causality but that people are often too quick to do so. This is another instance in which adaptive, evolutionary qualities have done people a disservice in the face of complex debates and rational thinking. In particular, people have a difficult time sitting with uncertainty and an especially hard time accepting coincidence. The chapter then considers the evidence from decades of psychological research showing people’s misunderstanding of cause and effect and the elaborate coping mechanisms they have developed as a result. It also suggests some ways to help people better comprehend true causality, without diminishing their ability to attribute cause when it is in fact appropriate.

On the optimality of LEPT and μc rules for parallel processors and dependent arrival processes

1993 ◽  
Vol 25 (04) ◽  
pp. 979-996
Author(s):  
Arie Hordijk ◽  
Ger Koole
Keyword(s):  
Dynamic Programming ◽  
Parallel Processors ◽  
Arrival Process ◽  
Scheduling Problems ◽  
Cost Structures ◽  
Markov Decision ◽  
New Type ◽  
Arrival Processes ◽  
Special Case

In this paper we study scheduling problems of multiclass customers on identical parallel processors. A new type of arrival process, called a Markov decision arrival process, is introduced. This arrival process can be controlled and allows for an indirect dependence on the numbers of customers in the queues. As a special case we show the optimality of LEPT and the µc-rule in the last node of a controlled tandem network for various cost structures. A unifying proof using dynamic programming is given.

scholarly journals A Multi-Objective Optimization Problem on Evacuating 2 Robots from the Disk in the Face-to-Face Model; Trade-Offs between Worst-Case and Average-Case Analysis

Information ◽  
2020 ◽  
Vol 11 (11) ◽  
pp. 506
Author(s):  
Huda Chuangpishit ◽  
Konstantinos Georgiou ◽  
Preeti Sharma
Keyword(s):  
Optimization Problem ◽  
Case Analysis ◽  
Worst Case Analysis ◽  
Computer Assisted ◽  
Average Case Analysis ◽  
Worst Case ◽  
Average Case ◽  
Face Model ◽  
Face To Face ◽  
The Face

The problem of evacuating two robots from the disk in the face-to-face model was first introduced by Czyzowicz et al. [DISC’2014], and has been extensively studied (along with many variations) ever since with respect to worst-case analysis. We initiate the study of the same problem with respect to average-case analysis, which is also equivalent to designing randomized algorithms for the problem. In particular, we introduce constrained optimization problem 2EvacF2F, in which one is trying to minimize the average-case cost of the evacuation algorithm given that the worst-case cost does not exceed w. The problem is of special interest with respect to practical applications, since a common objective in search-and-rescue operations is to minimize the average completion time, given that a certain worst-case threshold is not exceeded, e.g., for safety or limited energy reasons. Our main contribution is the design and analysis of families of new evacuation parameterized algorithms which can solve 2EvacF2F, for every w for which the problem is feasible. Notably, the worst-case analysis of the problem, since its introduction, has been relying on technical numerical, computer-assisted calculations, following tedious robot trajectory analysis. Part of our contribution is a novel systematic procedure, which given any evacuation algorithm, can derive its worst- and average-case performance in a clean and unified way.

A single-server queue with server vacations and a class of non-renewal arrival processes

1990 ◽  
Vol 22 (3) ◽  
pp. 676-705 ◽  
Author(s):  
David M. Lucantoni ◽  
Kathleen S. Meier-Hellstern ◽  
Marcel F. Neuts
Keyword(s):  
Waiting Times ◽  
Arrival Process ◽  
Single Server ◽  
Single Server Queue ◽  
Arbitrary Time ◽  
Markov Modulated Poisson Process ◽  
Special Cases ◽  
Server Queue ◽  
Arrival Processes ◽  
Markov Modulated

We study a single-server queue in which the server takes a vacation whenever the system becomes empty. The service and vacation times and the arrival process are all assumed to be mutually independent. The successive service times and the vacation times each form independent, identically distributed sequences with general distributions. A new class of non-renewal arrival processes is introduced. As special cases, it includes the Markov-modulated Poisson process and the superposition of phase-type renewal processes.Algorithmically tractable equations for the distributions of the waiting times at an arbitrary time and at arrivals, as well as for the queue length at an arbitrary time, at arrivals, and at departures are established. Some factorizations, which are known for the case of renewal input, are generalized to this new framework and new factorizations are obtained. The algorithmic implementation of these results is discussed.

scholarly journals Sign-rank Can Increase under Intersection

2021 ◽  
Vol 13 (4) ◽  
pp. 1-17
Author(s):  
Mark Bun ◽  
Nikhil S. Mande ◽  
Justin Thaler
Keyword(s):  
Communication Complexity ◽  
Function Class ◽  
Time Algorithm ◽  
Constant Factor ◽  
Pac Learning ◽  
New Techniques ◽  
Know How ◽  
Communication Problem ◽  
Analytic Complexity ◽  
Class Of Functions

The communication class UPP cc is a communication analog of the Turing Machine complexity class PP . It is characterized by a matrix-analytic complexity measure called sign-rank (also called dimension complexity), and is essentially the most powerful communication class against which we know how to prove lower bounds. For a communication problem f , let f ∧ f denote the function that evaluates f on two disjoint inputs and outputs the AND of the results. We exhibit a communication problem f with UPP cc ( f ) = O (log n ), and UPP cc ( f ∧ f ) = Θ (log 2 n ). This is the first result showing that UPP communication complexity can increase by more than a constant factor under intersection. We view this as a first step toward showing that UPP cc , the class of problems with polylogarithmic-cost UPP communication protocols, is not closed under intersection. Our result shows that the function class consisting of intersections of two majorities on n bits has dimension complexity n Omega Ω(log n ) . This matches an upper bound of (Klivans, O’Donnell, and Servedio, FOCS 2002), who used it to give a quasipolynomial time algorithm for PAC learning intersections of polylogarithmically many majorities. Hence, fundamentally new techniques will be needed to learn this class of functions in polynomial time.

scholarly journals Suppression May Improve Adaptation to Worry When Facing Uncertainty: Studying COVID-19 Pandemic

2021 ◽  
Vol 12 ◽  
Author(s):  
Ali Khatibi ◽  
Louise Sharpe ◽  
Mohsen Dehghani ◽  
Erfan Ghalibaf ◽  
Parham Hosseinchi ◽  
...  
Keyword(s):  
Emotion Regulation ◽  
Intolerance Of Uncertainty ◽  
Emotion Regulation Strategies ◽  
Short Term ◽  
Know How ◽  
Contamination Fear ◽  
The Face ◽  
Regulation Strategies ◽  
The Relationship ◽  
New Situation

The COVID-19 pandemic has been associated with increased uncertainty, fear and worry in everyone's life. The effect of changes in daily life has been studied widely, but we do not know how emotion-regulation strategies influence adaptation to a new situation to help them overcome worry in the face of uncertainty. Here, 1,064 self-selected Farsi speaking participants completed an online battery of questionnaires that measured fear of virus and illness, worry, intolerance of uncertainty, and emotion regulation (two subscales: reappraisal, suppression). We also documented the number of daily COVID-19 cases and deaths due to COVID-19 on the day in which participants completed the questionnaire. Our findings suggest a correlation between contamination fear and the number of daily-confirmed cases (r = 0.11), and the number of reported deaths due to COVID-19 (r = 0.09). Worry mediated the relationship between intolerance of uncertainty and fear of virus and illness (b = 0.16, 0.1141 < CI < 0.2113). In addition, suppression moderated the relationship between intolerance of uncertainty and worry (p < 0.01). Our results suggest that suppression (at least in the short term) can be an adaptive response to the worry associated with uncertainty. Suppression can reduce worry, which in turn can decrease fear of contamination and improve adaptation to social distancing requirements. Although, the observed correlations were significant, but considering the sample size, they are not strong, and they should be interpreted cautiously.

scholarly journals Ultrasound guided biopsy, a gold standard diagnostical test of the prostate cancer

2005 ◽  
Vol 52 (4) ◽  
pp. 23-26 ◽  
Author(s):  
I. Romics
Keyword(s):  
Prostate Cancer ◽  
Gold Standard ◽  
Middle Part ◽  
Time Span ◽  
Targeted Biopsy ◽  
Ultrasound Guided ◽  
New Techniques ◽  
Know How ◽  
Preoperative Antibiotics ◽  
Palpable Nodule

The author discusses preparations for ultrasound guided prostate biopsy, its technique conditions and the process of performing a biopsy. Every author proposes the use of preoperative antibiotics based prophylaxis. Differences may be found in the type, dosage and the time span of preoperative application. For anesthesia mostly lidocaine was proposed, which may be a gel applied in the rectum or used in the form a prostate infiltrate. The widest debate goes on in respect of defining the number of biopsies needed. Recently 8 or rather 10 samples are proposed to be taken. Twelve biopsies do offer an advantage compared to 6 although in case of 8 this isn?t so. According to the site of sample taking the apex, the base and the middle part are proposed. In case of a palpable nodule or any lesion, made visible by TRUS an additional, targeted, biopsy has to be performed. Certain new techniques like the 3D Doppler, contrast, intermittent and others shall also be presented. A repeated biopsy shall be necessary in case of PIN atypia, beyond that the author also discusses other indications for a repeated biopsy. We may expect the occurrence of direct postoperative complications and it is necessary to know how to treat these.

Sign in / Sign up

Export Citation Format

Share Document