English
Related papers

Related papers: The Bakers and Millers Game with Restricted Locati…

200 papers

We consider a game where a finite number of retailers choose a location, given that their potential consumers are distributed on a network. Retailers do not compete on price but only on location, therefore each consumer shops at the closest…

Computer Science and Game Theory · Computer Science 2019-01-03 Gaëtan Fournier , Marco Scarsini

Hedonic games are fundamental models for investigating the formation of coalitions among a set of strategic agents, where every agent has a certain utility for every possible coalition of agents it can be part of. To avoid the…

Computer Science and Game Theory · Computer Science 2026-02-17 Merlin de la Haye , Pascal Lenzner , Farehe Soheil , Marcus Wunderlich

We consider a variant of the hide-and-seek game in which a seeker inspects multiple hiding locations to find multiple items hidden by a hider. Each hiding location has a maximum hiding capacity and a probability of detecting its hidden…

Computer Science and Game Theory · Computer Science 2024-06-26 Bastián Bahamondes , Mathieu Dahan

Facility location games have been a topic of major interest in economics, operations research and computer science, starting from the seminal work by Hotelling. Spatial facility location models have successfully predicted the outcome of…

Computer Science and Game Theory · Computer Science 2017-10-10 Omer Ben-Porat , Moshe Tennenholtz

We study Nash equilibria in strategic facility location games where clients are located in an arbitrary metric space. Specifically, there are $n$ clients, and the goal is to choose a facility from a set of given locations, so that the total…

Computer Science and Game Theory · Computer Science 2026-04-21 Yue Gruszecki , Elliot Anshelevich

This paper studies a spatial competition game between two firms that sell a homogeneous good at some pre-determined fixed price. A population of consumers is spread out over the real line, and the two firms simultaneously choose location in…

Optimization and Control · Mathematics 2020-01-31 Gaëtan Fournier , Karine Van Der Straeten , Jörgen Weibull

We consider strategic games that are inspired by Schelling's model of residential segregation. In our model, the agents are partitioned into k types and need to select locations on an undirected graph. Agents can be either stubborn, in…

Computer Science and Game Theory · Computer Science 2021-08-24 Edith Elkind , Jiarui Gan , Ayumi Igarashi , Warut Suksompong , Alexandros A. Voudouris

We consider a coalition formation setting where each agent belongs to one of the two types, and agents' preferences over coalitions are determined by the fraction of the agents of their own type in each coalition. This setting differs from…

Computer Science and Game Theory · Computer Science 2019-03-04 Robert Bredereck , Edith Elkind , Ayumi Igarashi

We consider a team formation setting where agents have varying levels of expertise in a global set of required skills, and teams are ranked with respect to how well the expertise of teammates complement each other. We model this setting as…

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

Additively separable hedonic games (ASHGs) are a prominent model of coalition formation where agents' preferences are derived from their individual valuations of peers. While social welfare maximization in ASHGs has traditionally focused…

Computer Science and Game Theory · Computer Science 2026-05-20 Marta Pagano , Alexander Schlenga

We consider non-cooperative facility location games where both facilities and clients act strategically and heavily influence each other. This contrasts established game-theoretic facility location models with non-strategic clients that…

Computer Science and Game Theory · Computer Science 2024-06-17 Simon Krogmann , Pascal Lenzner , Louise Molitor , Alexander Skopalik

We propose a general class of symmetric games called position-optimization games. Given a probability distribution $Q$ over a set of targets $\mathcal{Y}$, the $n$ players each choose a position in a space $\mathcal{X}$. A player's utility…

Computer Science and Game Theory · Computer Science 2026-02-18 Rafael Frongillo , Melody Hsu , Mary Monroe , Anish Thilagar

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 incentivizes deviation from the proposed…

Computer Science and Game Theory · Computer Science 2024-06-04 Martin Bullinger , Sonja Kraiczy

In this paper, we study a variant of hedonic games, called \textsc{Seat Arrangement}. The model is defined by a bijection from agents with preferences for each other to vertices in a graph $G$. The utility of an agent depends on the…

Computer Science and Game Theory · Computer Science 2025-07-30 Hans L. Bodlaender , Tesshu Hanaka , Lars Jaffke , Hirotaka Ono , Yota Otachi , Tom C. van der Zanden

The decisions that human beings make to allocate time has significant bearing on economic output and to the sustenance of social networks. The time allocation problem motivates our formal analysis of the resource allocation game, where…

Computer Science and Game Theory · Computer Science 2018-08-28 Wei-Chun Lee , Vasilis Livanos , Ruta Mehta , Hari Sundaram

We study a recommendation system where sellers compete for visibility by strategically offering commissions to a platform that optimally curates a ranked menu of items and their respective prices for each customer. Customers interact…

Theoretical Economics · Economics 2025-10-07 Tushar Shankar Walunj , Veeraruna Kavitha , Jayakrishnan Nair , Priyank Agarwal

This paper addresses the problem of locating base stations in a certain area which is highly populated by mobile stations; each mobile station is assumed to select the closest base station. Base stations are modeled by players who choose…

Networking and Internet Architecture · Computer Science 2011-05-12 François Mériaux , Samson Lasaulce , Michel Kieffer

We study a non-cooperative two-sided facility location game in which facilities and clients behave strategically. This is in contrast to many other facility location games in which clients simply visit their closest facility. Facility…

Computer Science and Game Theory · Computer Science 2024-06-14 Simon Krogmann , Pascal Lenzner , Alexander Skopalik

We study the classic divide-and-choose method for equitably allocating divisible goods between two players who are rational, self-interested Bayesian agents. The players have additive values for the goods. The prior distributions on those…

Computer Science and Game Theory · Computer Science 2024-10-22 Jamie Tucker-Foltz , Richard Zeckhauser

The classical Hotelling game is played on a line segment whose points represent uniformly distributed clients. The $n$ players of the game are servers who need to place themselves on the line segment, and once this is done, each client gets…

Computer Science and Game Theory · Computer Science 2019-09-26 Avi Cohen , David Peleg
‹ Prev 1 2 3 10 Next ›