Skip to main content

7 Result(s)

within Felix Brandt Remove this filter Computer Science Remove this filter English Remove this filter Algorithm Analysis and Problem Complexity Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    On the Convergence of Swap Dynamics to Pareto-Optimal Matchings

    We study whether Pareto-optimal stable matchings can be reached via pairwise swaps in one-to-one matching markets with initial assignments. We consider housing markets, marriage markets, and roommate markets ...

    Felix Brandt, Anaëlle Wilczynski in Web and Internet Economics (2019)

  2. Chapter

    Computational Social Choice: The First Ten Years and Beyond

    Computational social choice is a research area at the intersection of computer science, mathematics, and economics that is concerned with aggregation of preferences of multiple agents. Typical applications inc...

    Haris Aziz, Felix Brandt, Edith Elkind, Piotr Skowron in Computing and Software Science (2019)

    Download PDF (330 KB) View Chapter

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

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

  5. No Access

    Chapter and Conference Paper

    Symmetries and the Complexity of Pure Nash Equilibrium

    Strategic games may exhibit symmetries in a variety of ways. A common aspect, enabling the compact representation of games even when the number of players is unbounded, is that players cannot (or need not) dis...

    Felix Brandt, Felix Fischer, Markus Holzer in STACS 2007 (2007)

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

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