A Nash Bargaining Approach to Retention Enhancing Bid Optimization in Sponsored Search Auctions with Discrete Bids

Bid optimization is now becoming quite popular in sponsored search auctions on the Web. Given a keyword and the maximum willingness to pay of each advertiser interested in the keyword, the bid optimizer generates a profile of bids for the advertisers with the objective of maximizing customer retention without compromising the revenue of the search engine. In this paper, we present a bid optimization algorithm that is based on a Nash bargaining model where the first player is the search engine and the second player is a virtual agent representing all the bidders. We make the realistic assumption that each bidder specifies a maximum willingness to pay values and a discrete, finite set of bid values. We show that the Nash bargaining solution for this problem always lies on a certain edge of the convex hull such that one end point of the edge is the vector of maximum willingness to pay of all the bidders. We show that the other endpoint of this edge can be computed as a solution of a linear programming problem. We also show how the solution can be transformed to a bid profile of the advertisers.

Truthful multi-armed bandit mechanisms for multi-slot sponsored search auctions

In pay-per-click sponsored search auctions which are currently extensively used by search engines, the auction for a keyword involves a certain number of advertisers (say k) competing for available slots (say m) to display their advertisements (ads for short). A sponsored search auction for a keyword is typically conducted for a number of rounds (say T). There are click probabilities mu(ij) associated with each agent slot pair (agent i and slot j). The search engine would like to maximize the social welfare of the advertisers, that is, the sum of values of the advertisers for the keyword. However, the search engine does not know the true values advertisers have for a click to their respective advertisements and also does not know the click probabilities. A key problem for the search engine therefore is to learn these click probabilities during the initial rounds of the auction and also to ensure that the auction mechanism is truthful. Mechanisms for addressing such learning and incentives issues have recently been introduced. These mechanisms, due to their connection to the multi-armed bandit problem, are aptly referred to as multi-armed bandit (MAB) mechanisms. When m = 1, exact characterizations for truthful MAB mechanisms are available in the literature. Recent work has focused on the more realistic but non-trivial general case when m > 1 and a few promising results have started appearing. In this article, we consider this general case when m > 1 and prove several interesting results. Our contributions include: (1) When, mu(ij)s are unconstrained, we prove that any truthful mechanism must satisfy strong pointwise monotonicity and show that the regret will be Theta T7) for such mechanisms. (2) When the clicks on the ads follow a certain click precedence property, we show that weak pointwise monotonicity is necessary for MAB mechanisms to be truthful. (3) If the search engine has a certain coarse pre-estimate of mu(ij) values and wishes to update them during the course of the T rounds, we show that weak pointwise monotonicity and type-I separatedness are necessary while weak pointwise monotonicity and type-II separatedness are sufficient conditions for the MAB mechanisms to be truthful. (4) If the click probabilities are separable into agent-specific and slot-specific terms, we provide a characterization of MAB mechanisms that are truthful in expectation.

An Implementation of Partitioned Scheduling Scheme for Hard Real-Time Tasks in Multicore Linux with Fair Share for Linux Tasks

The correctness of a hard real-time system depends its ability to meet all its deadlines. Existing real-time systems use either a pure real-time scheduler or a real-time scheduler embedded as a real-time scheduling class in the scheduler of an operating system (OS). Existing implementations of schedulers in multicore systems that support real-time and non-real-time tasks, permit the execution of non-real-time tasks in all the cores with priorities lower than those of real-time tasks, but interrupts and softirqs associated with these non-real-time tasks can execute in any core with priorities higher than those of real-time tasks. As a result, the execution overhead of real-time tasks is quite large in these systems, which, in turn, affects their runtime. In order that the hard real-time tasks can be executed in such systems with minimal interference from other Linux tasks, we propose, in this paper, an integrated scheduler architecture, called SchedISA, which aims to considerably reduce the execution overhead of real-time tasks in these systems. In order to test the efficacy of the proposed scheduler, we implemented partitioned earliest deadline first (P-EDF) scheduling algorithm in SchedISA on Linux kernel, version 3.8, and conducted experiments on Intel core i7 processor with eight logical cores. We compared the execution overhead of real-time tasks in the above implementation of SchedISA with that in SCHED_DEADLINE's P-EDF implementation, which concurrently executes real-time and non-real-time tasks in Linux OS in all the cores. The experimental results show that the execution overhead of real-time tasks in the above implementation of SchedISA is considerably less than that in SCHED_DEADLINE. We believe that, with further refinement of SchedISA, the execution overhead of real-time tasks in SchedISA can be reduced to a predictable maximum, making it suitable for scheduling hard real-time tasks without affecting the CPU share of Linux tasks.

Resale in Auctions with Financial Constraints

This paper analyzes auctions where bidders face nancial constraints that may force them to resell part of the property of the good (or subcontract part of a project) at a resale market. First we show that the ine¢ cient speculative equilibria of second- price auctions (Garratt and Tröger, 2006) generalizes to situations with partial resale where only the high value bidder is nancially constrained. However, when all players face nancial constraints the ine¢ cient speculative equilibria disappear. Therefore, for auctioning big facilities or contracts where all bidders are nancially constrained and there is a resale market, the second price auction remains a simple and appropriate mechanism to achieve an e¢ cient allocation.

Schizophrenia patients and their healthy siblings share disruption of white matter integrity in the left prefrontal cortex and the hippocampus but not the anterior cingulate cortex

Healthy siblings of schizophrenia patients have an almost 9-fold higher risk for developing the illness than the general population. Disruption of white matter (WM) integrity as indicated by reduced fractional anisotropy (FA) derived from diffusion tensor

'Adipaging': Aging and obesity share biological hallmarks related to a dysfunctional adipose tissue

The increasing aging of our societies is accompanied by a pandemic of obesity and related cardiometabolic disorders. Progressive dysfunction of the white adipose tissue is increasingly recognized as an important hallmark of the aging process which in turn contributes to metabolic alterations, multi-organ damage, and a systemic pro-inflammatory state ('inflammaging'). On the other hand, obesity, the paradigm of adipose tissue dysfunction, shares numerous biological similarities with the normal aging process such as chronic inflammation and multi-system alterations. Accordingly, understanding the interplay between accelerated aging related to obesity and adipose tissue dysfunction is critical to gain insight into the aging process in general as well as into the pathophysiology of obesity and other related conditions. Here we postulate the concept of 'adipaging' to illustrate the common links between aging and obesity and the fact that, to a great extent, obese adults are prematurely aged individuals.

HIV-1 envelope gp41 antibodies can originate from terminal ileum B cells that share cross-reactivity with commensal bacteria.

Monoclonal antibodies derived from blood plasma cells of acute HIV-1-infected individuals are predominantly targeted to the HIV Env gp41 and cross-reactive with commensal bacteria. To understand this phenomenon, we examined anti-HIV responses in ileum B cells using recombinant antibody technology and probed their relationship to commensal bacteria. The dominant ileum B cell response was to Env gp41. Remarkably, a majority (82%) of the ileum anti-gp41 antibodies cross-reacted with commensal bacteria, and of those, 43% showed non-HIV-1 antigen polyreactivity. Pyrosequencing revealed shared HIV-1 antibody clonal lineages between ileum and blood. Mutated immunoglobulin G antibodies cross-reactive with both Env gp41 and microbiota could also be isolated from the ileum of HIV-1 uninfected individuals. Thus, the gp41 commensal bacterial antigen cross-reactive antibodies originate in the intestine, and the gp41 Env response in HIV-1 infection can be derived from a preinfection memory B cell pool triggered by commensal bacteria that cross-react with Env.

Resulting trusts, joint borrowers and beneficial share

Reviews case law illustrating the courts' approach to beneficial ownership of property purchased in joint name by means of a joint mortgage but without any declaration of beneficial interest, the resulting trust and joint beneficial interest presumptions. Contrast the approach adopted in cases where one party made no contribution to the mortgage payments with those where both parties made a contribution. Highlights the courts' treatment of the right to buy discount afforded tenant purchasers and property purchased as a commercial venture rather than a home.

Cohabitation: quantifying an equitable share

Discusses the House of Lords judgment in Stack v Dowden on the factors the courts may consider when determining whether to rebut the presumption that former cohabitees, who were registered as joint legal owners of a property, were also joint beneficial owners with equal shares in the property. [From the Legal Journals Index]

Single Canadian mothers of Jamaican heritage share experiences about their children's education

This thesis examines the experiences of four single Canadian mothers of Jamaican heritage with respect to their children’s education. Four themes suggested in the literature—beliefs, practices, barriers, and supports—guided the research. The interviews with the mothers largely confirmed previous research in the field. As such, all the mothers believed that it was a shared responsibility between parents and teachers in supporting children’s education. The mothers’ practices included primarily at-home support and to a lesser extent at-school support but did not include strict discipline. The barriers most salient for these mothers were lack of time and resources. To help overcome these barriers, the mothers relied on domestic kin networks. From these findings, the thesis provides implications for both research and practice.