no code implementations • 10 Nov 2023 • Florian Brandl, Andrew Mackenzie
We revisit the problem of fairly allocating a sequence of time slots when agents may have different levels of patience (Mackenzie and Komornik, 2023).
no code implementations • 6 Jul 2023 • Florian Brandl, Felix Brandt
We give a robust characterization of Nash equilibrium by postulating coherent behavior across varying games: Nash equilibrium is the only solution concept that satisfies consequentialism, consistency, and rationality.
no code implementations • 26 Mar 2021 • Florian Brandl, Felix Brandt
In fact, the probability that the collective decision in round $n$ is made according to a maximal lottery increases exponentially in $n$.
no code implementations • 8 Feb 2021 • Haris Aziz, Florian Brandl
Rationing of healthcare resources has emerged as an important issue, which has been discussed by medical experts, policy-makers, and the general public.
Computer Science and Game Theory Theoretical Economics
no code implementations • 20 Aug 2020 • Haris Aziz, Florian Brandl
As a case study, we assume objects have priorities for agents and apply VER to sets of probabilistic allocations that are constrained by stability.
no code implementations • 7 May 2020 • Florian Brandl
A system of axioms is introduced whose unique solution is the social welfare function that averages the agents' beliefs and sums up their utility functions, normalized to have the same range.
no code implementations • 19 Apr 2016 • Florian Brandl, Felix Brandt, Manuel Eberl, Christian Geist
Our proof is obtained by formulating the claim as a satisfiability problem over predicates from real-valued arithmetic, which is then checked using an SMT (satisfiability modulo theories) solver.