English
Related papers

Related papers: Selfish Bin Covering

200 papers

Standard bin packing is the problem of partitioning a set of items with positive sizes no larger than 1 into a minimum number of subsets (called bins) each having a total size of at most 1. In bin packing games, an item has a positive…

Computer Science and Game Theory · Computer Science 2015-03-20 Gyorgy Dosa , Leah Epstein

In selfish bin packing, each item is regarded as a selfish player, who aims to minimize the cost-share by choosing a bin it can fit in. To have a least number of bins used, cost-sharing rules play an important role. The currently best known…

Computer Science and Game Theory · Computer Science 2023-10-03 Changjun Wang , Guochuan Zhang

We consider colorful bin packing games in which selfish players control a set of items which are to be packed into a minimum number of unit capacity bins. Each item has one of $m\geq 2$ colors and cannot be packed next to an item of the…

Computer Science and Game Theory · Computer Science 2017-11-13 Vittorio Bilò , Francesco Cellinese , Giovanna Melideo , Gianpiero Monaco

Public goods games study the incentives of individuals to contribute to a public good and their behaviors in equilibria. In this paper, we examine a specific type of public goods game where players are networked and each has binary actions,…

Computer Science and Game Theory · Computer Science 2022-04-04 Sixie Yu , Kai Zhou , P. Jeffrey Brantingham , Yevgeniy Vorobeychik

We introduce set packing games as an abstraction of situations in which $n$ selfish players select subsets of a finite set of indivisible items, and analyze the quality of several equilibria for this class of games. Assuming that players…

Computer Science and Game Theory · Computer Science 2023-03-06 Jasper de Jong , Marc Uetz

We study a model of selfish resource allocation that seeks to incorporate dependencies among resources as they exist in modern networked environments. Our model is inspired by utility functions with constant elasticity of substitution (CES)…

Computer Science and Game Theory · Computer Science 2017-05-04 Matthias Feldotto , Lennart Leder , Alexander Skopalik

We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with $\omega$-regular objectives. While the existence of an equilibrium whose payoff falls into a certain interval may be undecidable, we…

Computer Science and Game Theory · Computer Science 2010-06-24 Michael Ummels , Dominik Wojtczak

This paper investigates the relationship between the team-optimal solution and the Nash equilibrium (NE) to assess the impact of self-interested decisions on team performance. In classical team decision problems, team members typically act…

Optimization and Control · Mathematics 2025-08-20 Gehui Xu , Thomas Parisini , Andreas A. Malikopoulos

Nash equilibrium is the most commonly-used notion of equilibrium in game theory. However, it suffers from numerous problems. Some are well known in the game theory community; for example, the Nash equilibrium of repeated prisoner's dilemma…

Computer Science and Game Theory · Computer Science 2008-12-18 Joseph Y. Halpern

We introduce a new measure of the discrepancy in strategic games between the social welfare in a Nash equilibrium and in a social optimum, that we call selfishness level. It is the smallest fraction of the social welfare that needs to be…

Computer Science and Game Theory · Computer Science 2014-04-04 Krzysztof R. Apt , Guido Schaefer

This paper deals with the application of Approximation Theory type techniques to study a classical problem in Probability: estimating the parameter of a biased coin. For this purpose, a Minimax Estimation problem is considered and the…

Probability · Mathematics 2018-02-15 D. Benko , D. Coroian , P. D. Dragnev , R. Orive

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

To what extent does the structure of the players' strategy space influence the efficiency of decentralized solutions in congestion games? In this work, we investigate whether better performance are possible when restricting to load…

Computer Science and Game Theory · Computer Science 2022-02-25 Vittorio Bilò , Cosimo Vinci

In a society of completely selfish individuals where everybody is only interested in maximizing his own payoff, does any equilibrium exist for the society? John Nash proved more than 50 years ago that an equilibrium always exists such that…

Computer Science and Game Theory · Computer Science 2009-03-31 Xiaofei Huang

In this study, we formulate positive and negative externalities caused by changes in the supply of shared vehicles as ride sharing games. The study aims to understand the price of anarchy (PoA) and its improvement via a coordination…

Computer Science and Game Theory · Computer Science 2016-04-05 Tatsuya Iwase , Takahiro Shiga

Computational aspects of solution notions such as Nash equilibrium have been extensively studied, including settings where the ultimate goal is to find an equilibrium that possesses some additional properties. Furthermore, in order to…

Computational Complexity · Computer Science 2023-05-09 Bruce M. Kapron , Koosha Samieefar

In a society of multiple individuals, if everybody is only interested in maximizing his own payoff, will there exist any equilibrium for the society? John Nash proved more than 50 years ago that an equilibrium always exists such that nobody…

Computer Science and Game Theory · Computer Science 2009-01-26 Xiaofei Huang

This paper investigates the efficiency loss in social cost caused by strategic bidding behavior of individual participants in a supply-demand balancing market, and proposes a mechanism to fully recover equilibrium social optimum via…

Optimization and Control · Mathematics 2021-06-22 Kaiying Lin , Beibei Wang , Pengcheng You

We investigate the equilibrium behavior for the decentralized quadratic cheap talk problem in which an encoder and a decoder, viewed as two decision makers, have misaligned objective functions. In prior work, we have shown that the number…

Information Theory · Computer Science 2019-11-13 Serkan Sarıtaş , Philippe Furrer , Sinan Gezici , Tamás Linder , Serdar Yüksel

The aim of this paper is to formulate and study a stochastic model for the management of environmental assets in a geographical context where in each place the local authorities take their policy decisions maximizing their own welfare,…

Optimization and Control · Mathematics 2025-10-27 Emmanuelle Augeraud-Véron , Daria Ghilli , Fausto Gozzi , Marta Leocata
‹ Prev 1 2 3 10 Next ›