-
Chapter and Conference Paper
The Computational Complexity of Random Serial Dictatorship
In social choice settings with linear preferences, random dictatorship is known to be the only social decision scheme satisfying strategyproofness and ex post efficiency. When also allowing indifferences, random ...
-
Chapter and Conference Paper
The Complexity of Computing Minimal Unidirectional Covering Sets
Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of stability. Examples can be found in are...
-
Chapter and Conference Paper
Tournament Solutions and Their Applications to Multiagent Decision Making
Given a finite set of alternatives and choices between all pairs of alternatives, how to choose from the entire set in a way that is faithful to the pairwise comparisons? This simple, yet captivating, problem ...
-
Chapter and Conference Paper
PageRank as a Weak Tournament Solution
We observe that ranking systems—a theoretical framework for web page ranking and collaborative filtering introduced by Altman and Tennenholtz—and tournament solutions—a well-studied area of social choice theor...
-
Article
How to obtain full privacy in auctions
Privacy has become a factor of increasing importance in auction design. We propose general techniques for cryptographic first-price and (M+1)st-price auction protocols that only yield the winners' identities a...
-
Chapter and Conference Paper
On Correctness and Privacy in Distributed Mechanisms
Mechanisms that aggregate the possibly conflicting preferences of individual agents are studied extensively in economics, operations research, and lately computer science. Perhaps surprisingly, the classic lit...
-
Chapter and Conference Paper
Efficient Cryptographic Protocol Design Based on Distributed El Gamal Encryption
We propose a set of primitives based on El Gamal encryption that can be used to construct efficient multiparty computation protocols for certain low-complexity functions. In particular, we show how to privatel...
-
Chapter and Conference Paper
Efficient Privacy-Preserving Protocols for Multi-unit Auctions
The purpose of multi-unit auctions is to allocate identical units of a single type of good to multiple agents. Besides well-known applications like the selling of treasury bills, electrical power, or spectrum ...
-
Chapter and Conference Paper
Fully Private Auctions in a Constant Number of Rounds
We present a new cryptographic auction protocol that prevents extraction of bid information despite any collusion of participants. This requirement is stronger than common assumptions in existing protocols tha...
-
Chapter and Conference Paper
Antisocial Agents and Vickrey Auctions
In recent years auctions have become more and more important in the field of multiagent systems as useful mechanisms for resource allocation and task assignment. In many cases the Vickrey (second-price sealed-...
-
Chapter and Conference Paper
Cryptographic Protocols for Secure Second-Price Auctions
In recent years auctions have become more and more important in the field of multiagent systems as useful mechanisms for resource allocation, task assignment and last but not least electronic commerce. In many...