The VCG mechanism is the standard method to incentivize bidders in combinatorial auctions to bid truthfully. Under the VCG mechanism, the auctioneer can sometimes increase revenue by “burning” items. We study this phenomenon in a setting where items are described by a number of attributes. The value of an attribute corresponds to a quality level, and bidders’ valuations are non-decreasing in th...

The objective of this study is to examine whether analysts fully incorporate a nonproportionate algorithm of cost-change relative to revenue-change in forecasting earnings. We conjecture that the errors in analysts’ earnings forecasts made in the first month after the fiscal year-end are largely due to the errors in estimating expenses as a result of analysts’ use of a proportionate cost-change...

W e consider a supply chain with a supplier that sells to a retailer under a revenue-sharing arrangement. Demand is uncertain and unobservable to the supplier. We assume that the retailer is rational, that is, the retailer behaves opportunistically and underreports sales revenues to the supplier whenever such underreporting is profitable. Assuming the supplier has the ability to audit the retai...

It was recently discovered by Baik, Deift and Johansson [4] that the asymptotic distribution of the length of the longest increasing subsequence in a permutation chosen uniformly at random from Sn, properly centred and normalised, is the same as the asymptotic distribution of the largest eigenvalue of an n × n GUE random matrix, properly centred and normalised, as n → ∞. This distribution had e...

In a famous paper 8] Hammersley investigated the length L n of the longest increasing subsequence of a random n-permutation. Implicit in that paper is a certain one-dimensional continuous-space interacting particle process. By studying a hydrodynamical limit for Hammersley's process we show by fairly \soft" arguments that limn ?1=2 EL n = 2. This is a known result, but previous proofs (Vershik-...

We compute the limit distribution for the (centered and scaled) length of the longest increasing subsequence of random colored permutations. The limit distribution function is a power of that for usual random permutations computed recently by Baik, Deift, and Johansson (math.CO/9810105). In the two–colored case our method provides a different proof of a similar result by Tracy and Widom about t...

Connections between longest increasing subsequences in random permutations and eigenvalues of random matrices with complex entries have been intensely studied. This note applies properties of random elements of the finite general linear group to obtain results about the longest increasing subsequence in non-uniform random permutations.

One of Padang City's sources local revenue is hotel taxes. This study aims to analyze the potential tax and factors that influence revenue, as well formulate strategies increasing in city Padang. The primary data collection used a purposive sampling technique, while Slovin method was determine 60 samples reveal average rates. analytical analysis calculations, multiple linear regression, SWOT QS...