Results 1 - 10 of 291

Alternatives to Truthfulness are Hard to Recognize

by Vincenzo Auletta, Paolo Penna, Carmine Ventre
"... The central question in mechanism design is how to implement a given social choice function. One of the most studied concepts is that of truthful implementations in which truth-telling is always the best response of the players. The Revelation Principle says that one can focus on truthful implementa ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Principle does not hold, non-truthful implementations become interesting since they might be the only way to implement a social choice function of interest. In this work we show that, although non-truthful implementations may exist, they are hard to find. Namely, it is NP-hard to decide if a given social

Towards a characterization of truthful combinatorial auctions

by Ron Lavi, Noam Nisan , 2003
"... This paper analyzes implementable social choice functions (in dominant strategies) over restricted domains of preferences, the leading example being combinatorial auc-tions. Our work generalizes the characterization of Roberts (1979) who showed that truthful mechanisms over unrestricted domains with ..."
Abstract - Cited by 135 (20 self) - Add to MetaCart
with at least 3 possible outcomes must be “affine maximizers”. We show that truthful mechanisms for combinatorial auc-tions (and related restricted domains) must be “almost affine maximizers ” if they also satisfy an additional requirement of “independence of irrelevant alternatives”. This re

Generalizing data to provide anonymity when disclosing information

by Pierangela Samarati, Latanya Sweeney - In Proc. PODS , 1998
"... The proliferation of information on the Internet and access to fast computers with large storage capaci-ties has increased the volume of information collected and disseminated about individuals. The existence os these other data sources makes it much easier to re-identify individuals whose private i ..."
Abstract - Cited by 194 (3 self) - Add to MetaCart
individual to whom the released data refer cannot be denitively recognized. Our approach protects against linking to other data. It is based on the concepts of gen-eralization, by which stored values can be replaced with semantically consistent and truthful but less precise alternatives, and of k

Recognizing Members of the Tournament Equilibrium Set is NP-hard

by Felix Brandt, Felix Fischer, Paul Harrenstein , 711
"... A recurring theme in the mathematical social sciences is how to select the “most desirable ” elements given a binary dominance relation on a set of alternatives. Schwartz’s tournament equilibrium set (TEQ) ranks among the most intriguing, but also among the most enigmatic, tournament solutions that ..."
Abstract - Add to MetaCart
set and Dutta’s minimal covering set. We show that the problem of deciding whether a given alternative is contained in TEQ is NP-hard. 1

Alternative and

by unknown authors , 2011
"... orthodox medicine and the “odd ” principle self-curing. Common colds from viruses are an example. Also, the placebo effect is very potent when faith in “belief-of-cure ” is high. Neurobiol-ogy proves that the central release of endorphins increases tolerance to pain and transition to con-ditioned re ..."
Abstract - Add to MetaCart
analysis can valid conclusions be drawn with regard to signifi-cant success. The Truth Successful training of health care workers demands recognition of variations within ranges of what is healthy, sustainable, durable, and acceptable. Good discrimination must be taught, recognized, and learned by all

Whom You Know Matters: Venture Capital Networks and Investment Performance,

by Yael Hochberg , Alexander Ljungqvist , Yang Lu , Steve Drucker , Jan Eberly , Eric Green , Yaniv Grinstein , Josh Lerner , Laura Lindsey , Max Maksimovic , Roni Michaely , Maureen O'hara , Ludo Phalippou Mitch Petersen , Jesper Sorensen , Per Strömberg Morten Sorensen , Yael Hochberg , Johnson - Journal of Finance , 2007
"... Abstract Many financial markets are characterized by strong relationships and networks, rather than arm's-length, spot-market transactions. We examine the performance consequences of this organizational choice in the context of relationships established when VCs syndicate portfolio company inv ..."
Abstract - Cited by 138 (8 self) - Add to MetaCart
the leading alternative explanation for the performance-enhancing role of VC networking is simply experience (e.g., Kaplan, Martel, and Strömberg (2003)). It seems plausible that the better-4 networked VCs are also the older and more experienced VCs. To rule out that our measures of network centrality merely

TRUTH AND CIRCULAR DEFINITIONS

by Francesco Orilia, Achille C. Varzi
"... This original and enticing book provides a fresh, unifying perspective on many old and new logico-philosophical conundrums. Its basic thesis is that many concepts central in ordinary and philosophical discourse are inherently circular and thus cannot be fully understood as long as one remains within ..."
Abstract - Add to MetaCart
within the confines of a standard theory of definitions. As an alternative, the authors develop a revision theory of definitions, which allows definitions to be circular without this giving rise to contradiction (but, at worst, to “vacuous ” uses of definienda). The theory is applied with varying levels

On the truthfulness of petal graphs for visualisation of data

by Frode Eika Sandnes
"... A petal graph is an aesthetically attractive and applauded tool for visualising parameter sets. For instance, petal graphs are often used by Norwegian policy makers and decision makers in higher education as the Ministry of Education and Research relies on petal graphs in their reports. This study a ..."
Abstract - Add to MetaCart
argues that petal graphs are prone to misinterpretation. It is challenging to interpret a petal graph in general, it is hard to compare two or more petal graphs and this study demonstrates that the physical characteristics of petal graphs can be incorrect in terms of the parameters on display. This study

Approximation Techniques for Utilitarian Mechanism Design

by Patrick Briest, et al. , 2005
"... This paper deals with the design of efficiently computable incentive compatible, or truthful, mechanisms for combinatorial optimization problems with multi-parameter agents. We focus on approximation algorithms for NP-hard mechanism design problems. These algorithms need to satisfy certain monotonic ..."
Abstract - Cited by 92 (5 self) - Add to MetaCart
This paper deals with the design of efficiently computable incentive compatible, or truthful, mechanisms for combinatorial optimization problems with multi-parameter agents. We focus on approximation algorithms for NP-hard mechanism design problems. These algorithms need to satisfy certain

Random Strings Make Hard Instances

by Harry Buhrman, Pekka Orponen , 1996
"... We establish the truth of the "instance complexity conjecture" in the case of DEXT-complete sets w.r.t. polynomial time computations, and r.e. complete sets w.r.t. recursive computations. Specifically, we obtain for every DEXT-complete set A an exponentially dense subset C such that for ev ..."
Abstract - Cited by 10 (2 self) - Add to MetaCart
such that ic 1 (x : A) K 1 (x) \Gamma c holds for some constant c and all x 2 C. The proofs are based on the observation that Kolmogorov random strings are individually hard to recognize by bounded computations. 1 Introduction The notion of "instance complexity" was introduced in [5
Results 1 - 10 of 291