Core-competitive Auctions

One of the major drawbacks of the celebrated VCG auction is its low (or zero) revenue even when the agents have high value for the goods and a {\em competitive} outcome could have generated a significant revenue. A competitive outcome is one for which it is impossible for the seller and a subset of buyers to `block' the auction by defecting and negotiating an outcome with higher payoffs for themselves. This corresponds to the well-known concept of {\em core} in cooperative game theory. In particular, VCG revenue is known to be not competitive when the goods being sold have complementarities. A bottleneck here is an impossibility result showing that there is no auction that simultaneously achieves competitive prices (a core outcome) and incentive-compatibility. In this paper we try to overcome the above impossibility result by asking the following natural question: is it possible to design an incentive-compatible auction whose revenue is comparable (even if less) to a competitive outcome? Towards this, we define a notion of {\em core-competitive} auctions. We say that an incentive-compatible auction is $\alpha$-core-competitive if its revenue is at least $1/\alpha$ fraction of the minimum revenue of a core-outcome. We study the Text-and-Image setting. In this setting, there is an ad slot which can be filled with either a single image ad or $k$ text ads. We design an $O(\ln \ln k)$ core-competitive randomized auction and an $O(\sqrt{\ln(k)})$ competitive deterministic auction for the Text-and-Image setting. We also show that both factors are tight

Recent finding and new technologies in nephrolithiasis: a review of the recent literature

This review summarizes recent literature on advances regarding renal and ureteral calculi, with particular focus in areas of recent advances in the overall field of urolithiasis. Clinical management in everyday practice requires a complete understanding of the issues regarding metabolic evaluation and subgrouping of stone-forming patients, diagnostic procedures, effective treatment regime in acute stone colic, medical expulsive therapy, and active stone removal. In this review we focus on new perspectives in managing nephrolitihiasis and discuss recentadvances, including medical expulsive therapy, new technologies, and refinements of classical therapy such as shock wave lithotripsy, give a fundamental modification of nephrolithiasis management. Overall, this field appears to be the most promising, capable of new developments in ureterorenoscopy and percutaneous approaches. Further improvements are expected from robotic-assisted procedures, such as flexible robotics in ureterorenoscopy

Current state of laparoscopic and robotic surgery

Minimally invasive surgical innovation has exploded in recent times. Currently, conventional laparoscopy is most widely adopted as the costs are relatively low. However, robotics and single port surgery are leading a revolution in surgery for wealthy health-care systems. We explore the historical and contemporary areas of this evolution

Childhood risk factors for lifetime bulimic or compulsive eating by age 30 years in a British national birth cohort.

OBJECTIVE: To examine whether previously identified childhood risk factors for bulimia or compulsive eating (BCE) predict self-reported lifetime BCE by age 30 years in a prospective birth cohort. METHOD: Using data from the 1970 British Cohort Study at birth, 5, and 10 years, associations between 22 putative childhood risk factors and self-reported lifetime BCE at 30 years were examined, adjusting for sex and socioeconomic status. RESULTS: Only female sex (odds ratio (OR): 9.2; 95% confidence interval (CI): 1.9-43.7; p = 0.005), low self-esteem (OR:2.9; 95%CI: 1.1-7.5; p = 0.03) and high maternal education (OR:5.4; 95%CI: 2.0-14.8; p = 0.001) were significantly associated with higher risk of BCE, whereas high SES at 10 years was significantly protective (OR:0.2; 95%CI: 0.1-0.8; p = 0.022) of BCE in fully adjusted multivariable logistic regression analysis. DISCUSSION: Our findings do not support a strong role for childhood weight status and eating behaviours in the development of bulimia and compulsive eating pathology, rather suggesting a focus on self esteem may have greater relative importance. Findings in relation to maternal education and SES need further exploration

Private Outsourcing of Polynomial Evaluation and Matrix Multiplication using Multilinear Maps

{\em Verifiable computation} (VC) allows a computationally weak client to outsource the evaluation of a function on many inputs to a powerful but untrusted server. The client invests a large amount of off-line computation and gives an encoding of its function to the server. The server returns both an evaluation of the function on the client's input and a proof such that the client can verify the evaluation using substantially less effort than doing the evaluation on its own. We consider how to privately outsource computations using {\em privacy preserving} VC schemes whose executions reveal no information on the client's input or function to the server. We construct VC schemes with {\em input privacy} for univariate polynomial evaluation and matrix multiplication and then extend them such that the {\em function privacy} is also achieved. Our tool is the recently developed {mutilinear maps}. The proposed VC schemes can be used in outsourcing {private information retrieval (PIR)}.Comment: 23 pages, A preliminary version appears in the 12th International Conference on Cryptology and Network Security (CANS 2013

ClaimChain: Improving the Security and Privacy of In-band Key Distribution for Messaging

The social demand for email end-to-end encryption is barely supported by mainstream service providers. Autocrypt is a new community-driven open specification for e-mail encryption that attempts to respond to this demand. In Autocrypt the encryption keys are attached directly to messages, and thus the encryption can be implemented by email clients without any collaboration of the providers. The decentralized nature of this in-band key distribution, however, makes it prone to man-in-the-middle attacks and can leak the social graph of users. To address this problem we introduce ClaimChain, a cryptographic construction for privacy-preserving authentication of public keys. Users store claims about their identities and keys, as well as their beliefs about others, in ClaimChains. These chains form authenticated decentralized repositories that enable users to prove the authenticity of both their keys and the keys of their contacts. ClaimChains are encrypted, and therefore protect the stored information, such as keys and contact identities, from prying eyes. At the same time, ClaimChain implements mechanisms to provide strong non-equivocation properties, discouraging malicious actors from distributing conflicting or inauthentic claims. We implemented ClaimChain and we show that it offers reasonable performance, low overhead, and authenticity guarantees.Comment: Appears in 2018 Workshop on Privacy in the Electronic Society (WPES'18