Seminarium „Gry, mechanizmy i sieci społeczne”

Organizatorzy

• dr hab. Oskar Skibski
• dr hab. Piotr Skowron

Informacje

Strona domowa

Dziedziny badań

• Gry, mechanizmy i sieci społeczne
• Sztuczna inteligencja i systemy wieloagentowe

Lista referatów

• 5 grudnia 2024 12:15
  Grzegorz Lisowski (AGH University of Science and Technology)
  Two-Sided Manipulation Games in Stable Matching Markets (Two-Sided Manipulation Games in Stable Matching Markets)
  The Deferred Acceptance algorithm is an elegant procedure for finding a stable matching in two-sided matching markets. It ensures that no pair of agents prefers each other to their matched partners. In this work, we …

  ---

• 28 listopada 2024 12:15
  Marcin Dziubiński (University of Warsaw)
  General Lotto solvable cases of the Colonel Blotto game (General Lotto solvable cases of the Colonel Blotto game)
  We derive new equilibrium strategies for the discrete Colonel Blotto game for all the numbers of resources and battlefields for which the game can be solved using the discrete General Lotto game of [Hart, 2008]. …

  ---

• 17 października 2024 12:15
  Krzysztof Rogowski (University of Warsaw)
  Strategy proof location mechanisms on graphs with a cycle (Strategy proof location mechanisms on graphs with a cycle)
  The facility location problem involves selecting an optimal point on a graph to serve a group of agents, who may act strategically by misreporting their preferences to maximize their individual utility. This behavior motivates the …

  ---

• 3 października 2024 12:00
  Georgios Papasotiropoulos (University of Warsaw)
  As Time Goes By: Adding a Temporal Dimension Towards Resolving Delegations in Liquid Democracy
  In recent years, the study of various models and questions related to Liquid Democracy has been of growing interest among the community of Computational Social Choice. A concern that has been raised is that the …

  ---

• 16 maja 2024 12:45
  Łukasz Janeczko (AGH University of Science and Technology)
  Discovering Consistent Subelections (Discovering Consistent Subelections)
  We show how hidden interesting subelections can be discovered in ordinal elections. An interesting subelection consists of a reasonably large set of voters and a reasonably large set of candidates such that the former have …

  ---

• 16 maja 2024 12:00
  Grzegorz Pierczyński (AGH University of Science and Technology)
  Single-Winner Voting with Alliances: Avoiding the Spoiler Effect (Single-Winner Voting with Alliances: Avoiding the Spoiler Effect)
  We study the setting of single-winner elections with ordinal preferences where candidates might be members of alliances (which may correspond to e.g., political parties, factions, or coalitions). However, we do not assume that candidates from …

  ---

• 11 kwietnia 2024 12:15
  Piotr Kępczyński (University of Warsaw)
  Extending node centrality measures to group centrality measures
  During the presentation I will talk about the problem of creating group centrality measures based on node centrality measures. I will show previously known and obvious extension methods and discuss their pros and cons. I …

  ---

• 21 marca 2024 12:15
  Krzysztof Apt (CWI, Amsterdam and University of Warsaw)
  Characterization of Incentive Compatible Single-parameter Mechanisms Revisited
  We review the characterization of incentive compatible single-parameter mechanisms introduced by Archer and Tardos in 2001. We argue that the claimed (and often cited) uniqueness result has not been established in the computer science literature …

  ---

• 29 lutego 2024 12:15
  Sonja Kraiczy (University of Oxford)
  Stability in Random Hedonic Games (Stability in Random Hedonic Games)
  Partitioning a large group of employees into teams can prove difficult because unsatisfied employees may want to transfer to other teams. In this case, the team (coalition) formation is unstable and incentivises deviation from the …

  ---

• 1 lutego 2024 12:00
  Tomáš Masařík (University of Warsaw)
  A Generalised Theory of Proportionality in Collective Decision Making
  We consider a voting 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 …

  ---

• 25 stycznia 2024 12:15
  Piotr Faliszewski (AGH University of Science and Technology)
  Guide to Experiments in COMSOC (Guide to Experiments in COMSOC)
  In this talk I will discuss how numerical experiments on elections were typically performed in computational social choice and what we can learn from it. In particular, we will see what election sizes were considered …

  ---

• 7 grudnia 2023 10:15
  Tomasz Wąs (LAMSADE, Paryż)
  Fairly Allocating Goods and (Terrible) Chore)
  We study the fair allocation of mixtures of indivisible goods and chores under lexicographic preferences—a subdomain of additive preferences. A prominent fairness notion for allocating indivisible items is envy-freeness up to any item (EFX). Yet, …

  ---

• 30 listopada 2023 12:15
  Marcin Dziubiński (University of Warsaw)
  Interconnected Battles
  We study a model of multibattle contest with two players and spillovers of efforts between battles. The players distribute their costly efforts across the battles. Each battle receives effort assigned to it directly (real efforts) as well as …

  ---

• 23 listopada 2023 12:15
  Marcin Waniek (University of Warsaw)
  Modelling global market access using networks
  In this (very much in progress) work we use network science techniques to model access of different locations around the world to the global market. It was shown in the literature that it is possible …

  ---

• 9 listopada 2023 12:00
  Grzegorz Lisowski (AGH University of Science and Technology)
  Strategic Cost Selection in Participatory Budgeting
  We study strategic behaviour of project proposers in the  context of approval-based participatory budgeting, assuming that the votes are fixed and known and the proposers want to set as high project prices as possible, provided that their …

  ---