15296084
Designing online selling mechanisms: Transparency levels and prices
Sellers increasingly compete with innovative Internet-based selling mechanisms, revealing or concealing market information. Transparency strategy involves design choices by firms that influence the availability and accessibility of information about products and prices. We develop decision support models for suppliers to set prices for online mechanisms with different transparency levels. We then empirically analyze the price levels set by airlines across transparent and opaque online travel agencies. Our results suggest that airlines can increase profit by increasing price differentials or influencing OTA transparency differences. We also discuss application generality and limitations of our results.
7914809
Predicting Bidders' Willingness to Pay in Online Multiunit Ascending Auctions: Analytical and Empirical Insights
We develop a real-time estimation approach to predict bidders' maximum willingness to pay in a multiunit ascending uniform-price and discriminatory-price (Yankee) online auction. Our two-stage approach begins with a bidder classification step, which is followed by an analytical prediction model. The classification model identifies bidders as either adopting a myopic best-response (MBR) bidding strategy or a non-MBR strategy. We then use a generalized bid-inversion function to estimate the willingness to pay for MBR bidders. We empirically validate our two-stage approach using data from two popular online auction sites. Our joint classification-and-prediction approach outperforms two other naive prediction strategies that draw random valuations between a bidder's current bid and the known market upper bound. Our prediction results indicate that, on average, our estimates are within 2% of bidders' revealed willingness to pay for Yankee and uniform-price multiunit auctions. We discuss how our results can facilitate mechanism-design changes such as dynamic-bid increments and dynamic buy-it-now prices.
11409534
Risk profile and consumer shopping behavior in electronic and traditional channels
This paper develops an economic model that captures consumer shopping channel choices based on shopping channel characteristics and consumer risk profiles--risk-neutral or risk-averse. Analyses of results show that after making purchases through one channel, electronic or traditional, risk-averse consumers tend to be more loyal customers than risk-neutral consumers. Further, the two types of consumers may exhibit split channel behavior--risk-neutral consumers prefer one channel and risk-averse consumers prefer the other. However, risk-neutral consumers are not always more likely to prefer electronic channel than risk-averse consumers. Implications for retailer pricing strategies are discussed.
62621279
Estimating Internet Users' Demand Characteristics
We investigate two parametric approaches and one non-parametric approach toestimating Internet users' value-of-time, an important characteristic ofdemand for Internet services. The advantages of these approaches are madeclear and their limitations discussed. The models are tested with datagenerated from our similation model of the Internet economy. Given thecharacteristics of the data, we investigate parametric count-data modelsfirst. While reasonably good results are obtained on all medium- andlarge-sized jobs, the method fails on small-sized ones. Second, we develop anonparametric quasi-Bayesian update algorithm for retrieving the underlyingdistribution function of Internet users' value-of-time purely fromobservations on their choices. Compared with the parametric count-data models,good results are obtained in every case.
57631
Insights and analyses of online auctions
166893960
Priority pricing of integrated services networks
14748622
Power Efficient Algorithms for Computing Fast Fourier Transform over Wireless Sensor Networks
Collaborative signal processing is one of the most promising applications that are currently being investigated for sensor networks. In this paper, we use FFT computation as a vehicle to highlight the issues involved in realizing distributed computations over sensor networks that have global and local communication and synchronization characteristics. We present a power efficient algorithm for computing 1-D Fast Fourier Transform (FFT) over single and multi-hop wireless sensor networks. The proposed algorithm reduces the number of transmissions, eliminates typical redundant computations in a distributed FFT algorithm and uniformly maps complex multiplications over all the sensors nodes by introducing an extra bit-complement permutation stage after first (log2N)/2 iterations. We show that the proposed algorithm improves energy consumption by 36% on the average on multi-hop sensor networks. This saving in energy consumption significantly improves the battery life of the sensor nodes thereby increasing lifetime of the sensor network.
8269092
Color and texture fusion: application to aerial image segmentation and GIS updating
Abstract This paper describes a new algorithm for combining color and texture information for the segmentation of color images. The algorithm uses maximum likelihood classification combined with a certainty based fusion criterion. The algorithm was validated using mosaics of real color textures. It was also tested on real outdoor color scenes and aerial images. This algorithm is part of a more complex system, which is currently being designed to assist an operator in updating an old map of an area using aerial images.
17746198
Large—scale parallel numerical integration
We present and analyze strategies which can be used for the parallel computation of large numbers of integrals which may be of different levels of difficulty. Parallelization on the integral level, which is generally used for large numbers of integrals, is combined with parallelization on the subregion level, which enables handling local integration difficulties within individual problems. This results in a new, hierarchical algorithm which incorporates load balancing on the integral level and on the subregion level. We report test results of the software and show that the hierarchical approach leads to a scalable integration algorithm.
14870566
An information fusion framework for robust shape tracking
Existing methods for incorporating subspace model constraints in shape tracking use only partial information from the measurements and model distribution. We propose a unified framework for robust shape tracking, optimally fusing heteroscedastic uncertainties or noise from measurement, system dynamics, and a subspace model. The resulting nonorthogonal subspace projection and fusion are natural extensions of the traditional model constraint using orthogonal projection. We present two motion measurement algorithms and introduce alternative solutions for measurement uncertainty estimation. We build shape models offline from training data and exploit information from the ground truth initialization online through a strong model adaptation. Our framework is applied for tracking in echocardiograms where the motion estimation errors are heteroscedastic in nature, each heart has a distinct shape, and the relative motions of epicardial and endocardial borders reveal crucial diagnostic features. The proposed method significantly outperforms the existing shape-space-constrained tracking algorithm. Due to the complete treatment of heteroscedastic uncertainties, the strong model adaptation, and the coupled tracking of double-contours, robust performance is observed even on the most challenging cases.
17420676
A workstation's communication performance benchmark
In this paper we propose a communication benchmark suite: BTU(Bits To the User). In the BTU benchmarking process, the vendor supplies a workstation running a UNIX* operating system, we install our benchmark program and connect the workstation to a testbed which emulates a LAN/WAN environment. The benchmark run will submit the workstation to a carefully designed combination of tests. The result is a predictor of what the user, at the application level, can expect in terms of bits sent to or received from a remote host. Our benchmark takes into account concurrent activities such as CPU and I/O activities which compete for resources on the test machine. The combination of these activities and concurrent activities on the network will interfere with the test machine’s communication performance. The automated BTU benchmark test suite produces results at various levels of abstractions ranging from a single number, characterizing average performance in the style of SPEC92, to a TCP time sequence chart for abnormal behaviors. We intend to serve the user of a workstation by providing information which should enable the users to make a reasonable judgment when acquiring a workstation with a specific configuration within certain cost constraints. Our results when used along with existing benchmarks will make a powerful combination for predicting overall performance. Neither price nor SPECmarks are as good a predictor of communication performance as that measured by BTUs. We conclude this paper with a discussion of extensions to faster networks and our plans for having the community accept this proposal as a communication benchmark.