English
Related papers

Related papers: Hedonic Expertise Games

200 papers

Additively Separable Hedonic Game (ASHG) are coalition-formation games where we are given a graph whose vertices represent $n$ selfish agents and the weight of each edge $uv$ denotes how much agent $u$ gains (or loses) when she is placed in…

Data Structures and Algorithms · Computer Science 2024-02-19 Tesshu Hanaka , Noleen Köhler , Michael Lampis

Games with incomplete preferences are an important model for studying rational decision-making in scenarios where players face incomplete information about their preferences and must contend with incomparable outcomes. We study the problem…

Computer Science and Game Theory · Computer Science 2024-08-13 Abhishek N. Kulkarni , Jie Fu , Ufuk Topcu

To verify the robustness of a program or protocol, it is common in the computer science community to rely on the theoretical framework of game theory. In particular, if one seeks to enforce a desired property, or specification, despite an…

Computer Science and Game Theory · Computer Science 2026-05-20 Léonard Brice

We study the subclass of singleton congestion games with identical and increasing cost functions, i.e., each agent tries to utilize from the least crowded resource in her accessible subset of resources. Our main contribution is a novel…

Computer Science and Game Theory · Computer Science 2020-11-04 Bugra Caskurlu , Ozgun Ekici , Fatih Erdem Kizilkaya

We propose a notion of a stable partition in a coalitional game that is parametrized by the concept of a defection function. This function assigns to each partition of the grand coalition a set of different coalition arrangements for a…

Computer Science and Game Theory · Computer Science 2007-05-23 Krzysztof R. Apt , Tadeusz Radzik

We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic results (such as the existence of a Nash equilibrium) no longer…

Computer Science and Game Theory · Computer Science 2014-12-10 Joseph Y. Halpern , Rafael Pass

Consider an important meeting to be held in a team-based organization. Taking availability constraints into account, an online scheduling poll is being used in order to decide upon the exact time of the meeting. Decisions are to be taken…

Computer Science and Game Theory · Computer Science 2016-11-29 Robert Bredereck , Jiehua Chen , Rolf Niedermeier , Svetlana Obraztsova , Nimrod Talmon

In multiplayer games with sequential decision-making, self-interested players form dynamic coalitions to achieve most-preferred temporal goals beyond their individual capabilities. We introduce a novel procedure to synthesize strategies…

Computer Science and Game Theory · Computer Science 2025-01-31 A. Kaan Ata Yilmaz , Abhishek Kulkarni , Ufuk Topcu

We study strategic location choice by customers and sellers, termed the Bakers and Millers Game in the literature. In our generalized setting, each miller can freely choose any location for setting up a mill, while each baker is restricted…

Computer Science and Game Theory · Computer Science 2025-06-09 Simon Krogmann , Pascal Lenzner , Alexander Skopalik

Coordinating the behaviour of self-interested agents in the presence of multiple Nash equilibria is a major research challenge for multi-agent systems. Pre-game communication between all the players can aid coordination in cases where the…

Computer Science and Game Theory · Computer Science 2025-02-18 Wei-Chen Lee , Alessandro Abate , Michael Wooldridge

We present a unified framework for characterizing local Nash equilibria in continuous games on either infinite-dimensional or finite-dimensional non-convex strategy spaces. We provide intrinsic necessary and sufficient first- and…

Optimization and Control · Mathematics 2014-11-11 Lillian J. Ratliff , Samuel A. Burden , S. Shankar Sastry

In Stackelberg v/s Stackelberg games a collection of leaders compete in a Nash game constrained by the equilibrium conditions of another Nash game amongst the followers. The resulting equilibrium problems are plagued by the nonuniqueness of…

Optimization and Control · Mathematics 2016-11-18 Ankur A. Kulkarni , Uday V. Shanbhag

Consider a very simple class of (finite) games: after an initial move by nature, each player makes one move. Moreover, the players have common interests: at each node, all the players get the same payoff. We show that the problem of…

Computer Science and Game Theory · Computer Science 2007-05-23 Francis Chu , Joseph Y. Halpern

Subgame perfect equilibria are specific Nash equilibria in perfect information games in extensive form. They are important because they relate to the rationality of the players. They always exist in infinite games with continuous…

Computer Science and Game Theory · Computer Science 2015-10-01 Stephane Le Roux

We revisit games in partition function form, i.e. cooperative games where the payoff of a coalition depends on the partition of the entire set of players. We assume that each coalition computes its worth having probabilistic beliefs over…

Computer Science and Game Theory · Computer Science 2026-05-05 Paraskevas V. Lekeas , Giorgos Stamatopoulos

We consider an optimal partition of resources (e.g. consumers) between several agents (e.g. experts), given utility functions ("wisdoms") for the agents and their capacities. This problem is a variant of optimal transport…

Optimization and Control · Mathematics 2016-04-07 Gershon Wolansky

In hedonic diversity games (HDGs), recently introduced by Bredereck, Elkind and Igarashi (2019), each agent belongs to one of two classes (men and women, vegetarians and meat-eaters, junior and senior researchers), and agents' preferences…

Computer Science and Game Theory · Computer Science 2019-11-21 Niclas Boehmer , Edith Elkind

Learning problems commonly exhibit an interesting feedback mechanism wherein the population data reacts to competing decision makers' actions. This paper formulates a new game theoretic framework for this phenomenon, called "multi-player…

Computer Science and Game Theory · Computer Science 2022-04-08 Adhyyan Narang , Evan Faulkner , Dmitriy Drusvyatskiy , Maryam Fazel , Lillian J. Ratliff

Multi-team games, prevalent in robotics and resource management, involve team members striving for a joint best response against other teams. Team-Nash equilibrium (TNE) predicts the outcomes of such coordinated interactions. However, can…

Computer Science and Game Theory · Computer Science 2024-11-01 Ahmed Said Donmez , Yuksel Arslantas , Muhammed O. Sayin

The additively separable hedonic game (ASHG) is a model of coalition formation games on graphs. In this paper, we intensively and extensively investigate the computational complexity of finding several desirable solutions, such as a Nash…

Computational Complexity · Computer Science 2019-10-23 Tesshu Hanaka , Hironori Kiya , Yasuhide Maei , Hirotaka Ono