scholarly journals Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening

Author(s):  
Mihir Bellare ◽  
Dennis Hofheinz ◽  
Scott Yilek
Noûs ◽  
2017 ◽  
Vol 53 (1) ◽  
pp. 134-159 ◽  
Author(s):  
Gerhard Schurz

2020 ◽  
Vol 68 ◽  
pp. 463-502 ◽  
Author(s):  
Dominik Peters ◽  
Martin Lackner

We introduce the domain of preferences that are single-peaked on a circle, which is a generalization of the well-studied single-peaked domain. This preference restriction is useful, e.g., for scheduling decisions, certain facility location problems, and for one-dimensional decisions in the presence of extremist preferences. We give a fast recognition algorithm of this domain, provide a characterisation by finitely many forbidden subprofiles, and show that many popular single- and multi-winner voting rules are polynomial-time computable on this domain. In particular, we prove that Proportional Approval Voting can be computed in polynomial time for profiles that are single-peaked on a circle. In contrast, Kemeny's rule remains hard to evaluate, and several impossibility results from social choice theory can be proved using only profiles in this domain.


2006 ◽  
Vol 6 (2) ◽  
pp. 173-183
Author(s):  
E. D'Hondt ◽  
P. Panangaden

It is well understood that the use of quantum entanglement significantly enhances the computational power of systems. Much of the attention has focused on Bell states and their multipartite generalizations. However, in the multipartite case it is known that there are several inequivalent classes of states, such as those represented by the W-state and the GHZ-state. Our main contribution is a demonstration of the special computational power of these states in the context of paradigmatic problems from classical distributed computing. Concretely, we show that the W-state is the only pure state that can be used to exactly solve the problem of leader election in anonymous quantum networks. Similarly we show that the GHZ-state is the only one that can be used to solve the problem of distributed consensus when no classical post-processing is considered. These results generalize to a family of W- and GHZ-like states. At the heart of the proofs of these impossibility results lie symmetry arguments.


Author(s):  
Gustaf Arrhenius ◽  
Mark Budolfson ◽  
Dean Spears

Choosing a policy response to climate change seems to demand a population axiology. A formal literature involving impossibility theorems has demonstrated that all possible approaches to population axiology have one or more seemingly counterintuitive implications. This leads to the worry that because axiological theory is radically unresolved, this theoretical ignorance implies serious practical ignorance about what climate policies to pursue. This chapter offers two deflationary responses to this worry. First, it may be that given the actual facts of climate change, all axiologies agree on a particular policy response. In this case, there would be a clear dominance conclusion, and the puzzles of axiology would be practically irrelevant (albeit still theoretically challenging). Second, despite the impossibility results, the authors prove the possibility of axiologies that satisfy bounded versions of all of the desiderata from the population axiology literature, which may be all that is needed for policy evaluation.


2019 ◽  
Vol 35 (3) ◽  
pp. 878-890
Author(s):  
Robert P. Lieli ◽  
Maxwell B. Stinchcombe ◽  
Viola M. Grolmusz

Sign in / Sign up

Export Citation Format

Share Document