Nie jesteś zalogowany | zaloguj się

Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego

  • Skala szarości
  • Wysoki kontrast
  • Negatyw
  • Podkreślenie linków
  • Reset

Seminarium „Gry, mechanizmy i sieci społeczne”

Cotygodniowe seminarium badawcze (brak strony WWW)

Lista referatów

  • 2023-03-16, godz. 12:15, 4050

    Stanisław Szufa (AGH, Kraków)

    Spoiler Susceptibility in Party Elections

    An electoral spoiler is usually defined as a losing candidate whose removal would affect the outcome by changing the winner. So far spoiler effects have been analyzed primarily for single-winner electoral systems. We consider this subject in the context of party elections, where there is no longe...

  • 2023-03-02, godz. 12:00, 4050

    Sonja Kraiczy (University of Oxford)

    Properties of the Mallows Model Depending on the Number of Alternatives: A Warning for an Experimentalist

    The Mallows model is a popular distribution for ranked data. We empirically and theoretically analyze how the properties of rankings sampled from the Mallows model change when increasing the number of alternatives. We find that real-world data behaves differently than the Mallows model, yet is in li...

  • 2023-02-02, godz. 12:00, zoom meeting

    Oskar Skibski (University of Warsaw)

    Closeness centrality via the Condorcet principle

    We provide a characterization of closeness centrality in the class of distance-based centralities. To this end, we introduce a natural property, called majority comparison, that states that out of two adjacent nodes the one closer to more nodes is more central. We prove that any distance-based centr...

  • 2023-01-12, godz. 12:15, 4050

    Michał Pawłowski (University of Warsaw)

    Optimizing ride-hailing fares using computational microeconomy tools

    Pricing ride-hailing fares sparked a rich line of work in computer science due to its complexity and multidimensionality of aspects. We add to this line of research by considering the model presented by Hikima et al. (AAAI, 2021). For this model, the authors claimed a 3-approximation of the optimum ...

  • 2023-01-05, godz. 12:00, spotkanie online

    Piotr Faliszewski (AGH University in Kraków)

    Map of Elections: Diversity, Polarization, and Agreement In Elections (+ some more)

    In this talk I will present the idea of the map of (ordinal) elections and argue what it is good for. First, we will spend considerable amount of time on understanding diversity, polarization, and agreement within elections on the map. Then, we will look at other applications, such as using the map ...

  • 2022-12-15, godz. 12:15, 4050

    Stanisław Kaźmierowski (University of Warsaw)

    Algorithm for solving the attack and interception game on networks

    The paper "Attack and interception in networks" (F. Bloch, K. Chatterjee, B. Dutta, 2022), describes a game where a single attacker chooses a target and a path and each node chooses a level of protection. Main results proposed in this paper are the existence and uniqueness of NE of the pro...

  • 2022-12-08, godz. 12:00, seminarium zdalne

    Piotr Skowron (Uniwersytet Warszawski)

    Proportionality in General Social Choice Models

    We consider a model where a number of candidates need to be selected subject to certain feasibility constraints. The model generalises committee elections (where there is a single constraint on the number of candidates that need to be selected), various elections with diversity constraints, the mode...

  • 2022-11-17, godz. 12:15, 4050

    Piotr Skowron (University of Warsaw)

    Proportional Participatory Budgeting with Additive Utilities

    We study voting rules for participatory budgeting, where a group of voters collectively decides which projects should be funded using a common budget. We allow the projects to have arbitrary costs, and the voters to have arbitrary additive valuations over the projects. We formulate an axiom (Extende...

  • 2022-11-03, godz. 12:00, seminarium zdalne

    Łukasz Janeczko (AGH)

    Ties in Multiwinner Approval Voting

    We investigate ties in multiwinner approval voting both theoretically and experimentally. Specifically, we analyze the computational complexity of 1) determining if there is a tie in a given election for a given rule, and 2) the complexity of counting the number of winning committees. We mainly conc...

  • 2022-10-20, godz. 12:15, 4050

    Jannik Peters (TU Berlin)

    Proportional Participatory Budgeting with Approval-Based Satisfaction Functions

    The ability to measure the satisfaction of (groups of) voters is a crucial prerequisite for formulating proportionality axioms in approval-based participatory budgeting elections. Two common -- but very different -- ways to measure the satisfaction of a voter consider (i) the number of approved proj...