2140816
Toward Comprehensive Real-Time Bidder Support in Iterative Combinatorial Auctions
Many auctions involve selling several distinct items simultaneously, where bidders can bid on the whole or any part of the lot. Such auctions are referred to as combinatorial auctions. Examples of such auctions include truck delivery routes, industrial procurement, and FCC spectrum. Determining winners in such auctions is an NP-hard problem, and significant research is being conducted in this area. However, multiple-round (iterative) combinatorial auctions present significant challenges in bid formulations as well. Because the combinatorial dynamics in iterative auctions can make a given bid part of a winning and nonwinning set of bids without any changes in the bid, bidders are usually not able to evaluate whether they should revise their bid at a given point in time or not. Therefore, in this paper we address various computational problems that are relevant from the bidder's perspective. In particular, we introduce two bid evaluation metrics that can be used by bidders to determine whether any given bid can be a part of the winning allocation and explore their theoretical properties. Based on these metrics, we also develop efficient data structures and algorithms that provide comprehensive information about the current state of the auction atany time, which can help bidders in evaluating their bids and bidding strategies. Our approach uses exponential memory storage but provides fast incremental update for new bids, thereby facilitating bidder support for real-time iterative combinatorial auctions.
17233820
IT-enabled transparent electronic markets: the case of the air travel industry
The electronic market hypothesis predicts that by reducing coordination costs, information technology (IT) will shift industrial organization from hierarchical to market-based forms of economic activity. While academic researchers and practitioners have witnessed these shifts with the advent of the Internet, there is little understanding about the process and the underlying forces that drive them. In this paper, we provide an in-depth analysis of the air travel industry, which has recently experienced significant IT-driven transformations. We conclude that, together with IT, pro-competitive laws and the information-intensive nature of air travel products have triggered competition for consumers with transparent market mechanisms, which is leading to the emergence of more transparent electronic markets in the air travel industry.
30721210
Economic analysis of consumer purchase intentions in electronic and traditional retail channels: competitive and strategic implications
We develop a multiattribute economic model to analyze consumer behavior for traditional and electronic channels based on consumers' risk profiles and risk-neutral or risk-averse. We then conduct comparative analyses of consumer purchase decisions to derive strategies for different channels. We study the attitudinal and economic factors that lead to specific purchase decisions under different combinations of price, delivery time, and product customization. We develop theoretical propositions concerning consumer channel switching behavior, incentives to consumers, and pricing strategies for different channels. We also use simulations to gain insights for cases where analytical model becomes intractable.
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.
57631
Insights and analyses of online auctions
166893960
Priority pricing of integrated services networks
18542805
IT infrastructure in emerging markets: arguing for an end-to-end perspective
To help sustain large-scale pervasive computing in emerging markets, researchers must address unique challenges in the delivery fabric and enterprise backbone. Such challenges present opportunities for high impact innovation. Although most research organizations have focused on developing consumer-facing solutions, we posit that future research must take an end-to-end perspective. That is, researchers must not only consider the front end (such as consumer devices) but also the medium to reach the consumer (for example, the delivery fabric) and the back end (for example, the enterprise backbone) to create an economically sustainable, scalable solution. Although our end-to-end perspective generalizes to all emerging markets, in this article, we mainly discuss the Indian market from which we based our observations.
30968721
Tracking Deformable Templates Using a Shortest Path Algorithm
This paper proposes a new technique to track deformable templates. We extend the typical graph algorithms that have been used for active contour recovery to incorporate shape information. The advantage of graph algorithms is that they are guaranteed to find the global minimum of the energy function. The difficulty with their traditional use for active contours is that they consider only two pixels at a time when recovering the contour, making it impossible to enforce shape constraints. We define the deformable template as a polygonal contour, demonstrate the proper mapping between the image, the contour, and a graph, and show how to apply Dijkstra's algorithm to track contours in image sequences. Examples are shown for deforming contours, articulated objects, and smooth contours being tracked in simple and complicated backgrounds. We also provide an analysis of the computational requirements.
5590959
CAD for polyp detection: an invaluable tool to meet the increasing need for colon-cancer screening
Abstract Colorectal cancer is the third most common cancer in both men and women and it was estimated that in 2003 nearly 150,000 cases would be diagnosed and 57,000 people would die. Screening has been accepted as a means for early detection of the disease, yet only a portion of the eligible population undergoes colorectal cancer screening, partially due to comfort issues of undergoing a full colonoscopic examination. Virtual colonoscopy (VC) has been demonstrated to be an effective means of performing screening and given the number of people who are candidate for screening better tools, such as Computer Aided Detection (CAD), are required to fulfill this increasing need. The developed CAD system, presented in this paper, has focused on the detection of polyps of sizes up to and including 20 mm. The results have demonstrated that: the developed algorithm generalizes, the sensitivity and specificity for middle- to large-sized polyps is on the average 95% while the overall sensitivity is roughly 88% and the false positive has remained at a manageable 4 per volume.
18770378
A new model for the recovery of cylindrical structures from medical image data
We introduce a novel analytic model formulation for recovering cylindrical structures (e.g., blood vessels) from segmented 3-D medical image data. Unlike all previous formulations, our model is capable of describing a cylinder with an arbitrary spine (a space curve based on cubic B-splines) and arbitrary cross section which is guaranteed to be orthogonal to the spine. Given this expressiveness, we are able to provide a second order continuous approximation to the centerline of nearly any tubular object. This information may be used for such tasks as a reformatting of the original image data in order to visually detect stenoses or aneurysms. In addition, the cross-section parameter values of our model may aid in automatically isolating these regions. We maintain a relatively simple cross-section function to make this detection straightforward (note that any cross-section function is possible). To describe fine detail in the data, we employ local finite element deformations from the model surface. Thus we are able to recover gross geometric approximations as well as quantify characteristics of the object such as its surface area. We apply our model to the recovery of both a healthy and diseased aorta from segmented CT acquisitions.
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.