English
Related papers

Related papers: Two-Stage Facility Location Games with Strategic C…

200 papers

We study the problem of strategic choice of arrival time to a single-server queue with opening and closing times when there is uncertainty regarding service speed. A Poisson population of customers choose their arrival time with the goal of…

Probability · Mathematics 2021-01-01 Liron Ravner , Yutaka Sakuma

We study a model of retail agglomeration where consumers are more likely to visit zones with a higher concentration of shops. This agglomerative effect makes zones with many retailers more attractive. The spatial distribution of retailers…

Theoretical Economics · Economics 2025-08-05 Minoru Osawa , Takashi Akamatsu , Yosuke Kogure

We consider a discrete population of users with homogeneous service demand who need to decide when to arrive to a system in which the service rate deteriorates linearly with the number of users in the system. The users have heterogeneous…

Computer Science and Game Theory · Computer Science 2016-05-30 Liron Ravner , Moshe Haviv , Hai L. Vu

We propose a model of interdependent scheduling games in which each player controls a set of services that they schedule independently. A player is free to schedule his own services at any time; however, each of these services only begins…

Computer Science and Game Theory · Computer Science 2016-06-01 Andres Abeliuk , Haris Aziz , Gerardo Berbeglia , Serge Gaspers , Petr Kalina , Nicholas Mattei , Dominik Peters , Paul Stursberg , Pascal Van Hentenryck , Toby Walsh

The Kelly or proportional allocation mechanism is a simple and efficient auction-based scheme that distributes an infinitely divisible resource proportionally to the agents bids. When agents are aware of the allocation rule, their…

Computer Science and Game Theory · Computer Science 2026-03-27 Younes Ben Mazziane , Cleque-Marlain Mboulou Moutoubi , Eitan Altman , Francesco De Pellegrini

Consider a multi-class preemptive-resume $M/D/1$ queueing system that supports advance reservations (AR). In this system, strategic customers must decide whether to reserve a server in advance (thereby gaining higher priority) or avoid AR.…

Computer Science and Game Theory · Computer Science 2018-06-22 Eran Simhon , David Starobinski

Networked public goods games model scenarios in which self-interested agents decide whether or how much to invest in an action that benefits not only themselves, but also their network neighbors. Examples include vaccination, security…

Computer Science and Game Theory · Computer Science 2021-09-03 David Kempe , Sixie Yu , Yevgeniy Vorobeychik

In this paper we formulate the fixed budget resource allocation game to understand the performance of a distributed market-based resource allocation system. Multiple users decide how to distribute their budget (bids) among multiple machines…

Distributed, Parallel, and Cluster Computing · Computer Science 2007-05-23 Michal Feldman , Kevin Lai , Li Zhang

This paper introduces a novel class of multi-stage resource allocation games that model real-world scenarios in which profitability depends on the balance between supply and demand, and where higher resource investment leads to greater…

Computer Science and Game Theory · Computer Science 2025-07-21 Marko Maljkovic , Gustav Nilsson , Nikolas Geroliminis

Proportionality is an attractive fairness concept that has been applied to a range of problems including the facility location problem, a classic problem in social choice. In our work, we propose a concept called Strong Proportionality,…

Computer Science and Game Theory · Computer Science 2022-06-15 Haris Aziz , Alexander Lam , Mashbat Suzuki , Toby Walsh

We study the competitive facility location problem, where a firm aims to establish new facilities in a market already occupied by competitors. In this problem, customer behavior is crucial for making optimal location decisions. We explore a…

Optimization and Control · Mathematics 2024-08-07 Ba Luat Le , Tien Mai , Thuy Anh Ta , Minh Hoang Ha , Duc Minh Vu

We consider a strategic variant of the facility location problem. We would like to locate a facility on a closed interval. There are n agents located on that interval, divided into two types: type 1 agents, who wish for the facility to be…

Computer Science and Game Theory · Computer Science 2015-07-20 Itai Feigenbaum , Jay Sethuraman

The paper proposes a two player game based strategy for resource allocation in service computing domain such as cloud, grid etc. The players are modeled as demand/workflows for the resource and represent multiple types of qualitative and…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-03-25 G Arun Kumar , Snehanshu Saha , Aravind Sundaresan , Bidisha Goswami

Distributed load balancing is the act of allocating jobs among a set of servers as evenly as possible. There are mainly two versions of the load balancing problem that have been studied in the literature: static and dynamic. The static…

Performance · Computer Science 2020-11-04 Nitish K. Panigrahy , Thirupathaiah Vasantam , Prithwish Basu , Don Towsley

We study the problem of allocating indivisible objects to a set of rational agents where each agent's final utility depends on the intrinsic valuation of the allocated item as well as the allocation within the agent's local neighbourhood.…

Computer Science and Game Theory · Computer Science 2019-11-18 Sagar Massand , Sunil Simon

Today's multiagent systems have grown too complex to rely on centralized controllers, prompting increasing interest in the design of distributed algorithms. In this respect, game theory has emerged as a valuable tool to complement more…

Systems and Control · Computer Science 2020-02-19 Rahul Chandan , Dario Paccagnan , Jason R. Marden

This paper examines equilibria in dynamic two-sided matching games, extending Gale and Shapley's foundational model to a non-cooperative, decentralized, and dynamic framework. We focus on markets where agents have utility functions and…

Theoretical Economics · Economics 2024-12-02 Nadia Guiñazú , Pablo Neme , Jorge Oviedo

In load balancing problems there is a set of clients, each wishing to select a resource from a set of permissible ones, in order to execute a certain task. Each resource has a latency function, which depends on its workload, and a client's…

Computer Science and Game Theory · Computer Science 2021-05-06 Vittorio Bilò , Gianpiero Monaco , Luca Moscardelli , Cosimo Vinci

Spatial evolutionary games are studied with myopic players whose payoff interest, as a personal character, is tuned from selfishness to other-regarding preference via fraternity. The players are located on a square lattice and collect…

Physics and Society · Physics 2012-03-07 Gyorgy Szabo , Attila Szolnoki

We address the problem of locating facilities on the $[0,1]$ interval based on reports from strategic agents. The cost of each agent is her distance to the closest facility, and the global objective is to minimize either the maximum cost of…

Computer Science and Game Theory · Computer Science 2017-01-04 Iddan Golomb , Christos Tzamos