Skip to main content

and
  1. No Access

    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 ...

    Haris Aziz, Felix Brandt, Markus Brill in Web and Internet Economics (2013)

  2. No Access

    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...

    Dorothea Baumeister, Felix Brandt, Felix Fischer, Jan Hoffmann in Algorithms and Complexity (2010)

  3. 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 ...

    Felix Brandt in Multiagent System Technologies (2010)

  4. No Access

    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...

    Felix Brandt, Felix Fischer in Internet and Network Economics (2007)

  5. No Access

    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...

    Felix Brandt in International Journal of Information Security (2006)

  6. No Access

    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...

    Felix Brandt, Tuomas Sandholm in Agent-Mediated Electronic Commerce. Design… (2006)

  7. No Access

    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...

    Felix Brandt in Information Security and Cryptology - ICISC 2005 (2006)

  8. No Access

    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 ...

    Felix Brandt, Tuomas Sandholm in Financial Cryptography and Data Security (2005)

  9. No Access

    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...

    Felix Brandt in Financial Cryptography (2003)

  10. No Access

    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-...

    Felix Brandt, Gerhard Weiß in Intelligent Agents VIII (2002)

  11. No Access

    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...

    Felix Brandt in Cooperative Information Agents V (2001)