Skip to main content

previous disabled Page of 2
and
  1. No Access

    Chapter and Conference Paper

    Development of a Language Extension for Configuration of Industrial Asset Capabilities in Self-organized Production Systems

    The process of managing and configuring industrial assets has produced a number of solutions over the last few years. Although a number of process models and standards simplify the management of manufacturing ...

    Eric Brandt, Felix Brandt, Dirk Reichelt in Intelligent Computing (2022)

  2. No Access

    Chapter and Conference Paper

    A Software Platform for Use Case Driven Human-Friendly Factory Interaction Using Domain-Specific Assets

    In current efforts to digitize manufacturing, a wide range of integration solutions are being considered to enable manufacturing processes to adapt to change. At the same time companies are currently strugglin...

    Felix Brandt, Eric Brandt, David Heik in Proceedings of the Future Technologies Con… (2021)

  3. No Access

    Chapter and Conference Paper

    Asset Administration Shell: Domain Specific Language Approach to Integrate Heterogeneous Device Endpoints

    Manufacturing systems face the challenge of connecting different actuators. A uniform integration of interfaces is already used in practice. However, how these interfaces are connected is usually the responsib...

    Felix Brandt, Eric Brandt, Javad Ghofrani in Proceedings of the Future Technologies Con… (2021)

  4. No Access

    Chapter and Conference Paper

    Managing Manufacturing Assets with End-Users in Mind

    In the field of management of manufacturing resources, there are a number of solutions to make it easier for the end user to work with equipment. Often the user does not gain an overview of the relevance of th...

    Eric Brandt, Felix Brandt, Dirk Reichelt in Advances in Information and Communication (2021)

  5. No Access

    Chapter

    Analyzing the Practical Relevance of the Condorcet Loser Paradox and the Agenda Contraction Paradox

    A large part of the social choice literature studies voting paradoxes in which seemingly mild properties are violated by common voting rules. In this chapter, we investigate the likelihood of the Condorcet Los...

    Felix Brandt, Christian Geist in Evaluating Voting Systems with Probability… (2021)

  6. No Access

    Chapter and Conference Paper

    TetraPackNet: Four-Corner-Based Object Detection in Logistics Use-Cases

    While common image object detection tasks focus on bounding boxes or segmentation masks as object representations, we consider the problem of finding objects based on four arbitrary vertices. We propose a nove...

    Laura Dörr, Felix Brandt, Alexander Naumann, Martin Pouls in Pattern Recognition (2021)

  7. No Access

    Chapter

    Exploring the No-Show Paradox for Condorcet Extensions

    An important and surprising phenomenon in voting theory is the No-Show Paradox (NSP), which occurs if a voter is better off by abstaining from an election. While it is known that certain voting rules suffer from ...

    Felix Brandt, Johannes Hofbauer in Evaluating Voting Systems with Probability… (2021)

  8. No Access

    Chapter

    Collective Choice Lotteries

    Randomization is playing an ever increasing role in economic design with examples ranging from fair allocation to matching markets to voting. I propose and briefly discuss three interdisciplinary and interrela...

    Felix Brandt in The Future of Economic Design (2019)

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

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

  11. No Access

    Chapter

    Algorithmic Economics und Operations Research

    Die Informatik hat viele Wissenschaften grundlegend beeinflusst, die Wirtschaftswissenschaften in besonders hohem Maße. Vor allem die enormen Fortschritte der Algorithmik und mathematischen Optimierung habe...

    Susanne Albers, Martin Bichler, Felix Brandt in 50 Jahre Universitäts-Informatik in München (2017)

  12. No Access

    Chapter and Conference Paper

    On the Discriminative Power of Tournament Solutions

    Tournament solutions constitute an important class of social choice functions that only depend on the pairwise majority comparisons between alternatives. Recent analytical results have shown that several conce...

    Felix Brandt, Hans Georg Seedig in Operations Research Proceedings 2014 (2016)

  13. No Access

    Chapter and Conference Paper

    On Popular Random Assignments

    One of the most fundamental and ubiquitous problems in microeconomics and operations research is how to assign objects to agents based on their individual preferences. An assignment is called popular if there ...

    Haris Aziz, Felix Brandt, Paul Stursberg in Algorithmic Game Theory (2013)

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

  15. No Access

    Chapter and Conference Paper

    From Arrow’s Impossibility to Schwartz’s Tournament Equilibrium Set

    Perhaps the most influential result in social choice theory is Arrow’s impossibility theorem, which states that a seemingly modest set of desiderata cannot be satisfied when aggregating preferences [1]. While ...

    Felix Brandt in Relational and Algebraic Methods in Computer Science (2011)

  16. No Access

    Chapter and Conference Paper

    Pareto Optimality in Coalition Formation

    A minimal requirement on allocative efficiency in the social sciences is Pareto optimality. In this paper, we identify a far-reaching structural connection between Pareto optimal and perfect partitions that ha...

    Haris Aziz, Felix Brandt, Paul Harrenstein in Algorithmic Game Theory (2011)

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

  18. No Access

    Chapter and Conference Paper

    On the Rate of Convergence of Fictitious Play

    Fictitious play is a simple learning algorithm for strategic games that proceeds in rounds. In each round, the players play a best response to a mixed strategy that is given by the empirical frequencies of act...

    Felix Brandt, Felix Fischer, Paul Harrenstein in Algorithmic Game Theory (2010)

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

  20. No Access

    Chapter and Conference Paper

    The Computational Complexity of Weak Saddles

    We continue the recently initiated study of the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. Brandt et al. gave a polynomial-time algorithm for computing w...

    Felix Brandt, Markus Brill, Felix Fischer, Jan Hoffmann in Algorithmic Game Theory (2009)

previous disabled Page of 2