Zobrazeno 1 - 10
of 111
pro vyhledávání: '"Monaco, Gianpiero"'
Publikováno v:
The 16th Conference on Web and Internet Economics (WINE 2020)
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 cost is th
Externí odkaz:
http://arxiv.org/abs/2007.08263
We investigate strong Nash equilibria in the \emph{max $k$-cut game}, where we are given an undirected edge-weighted graph together with a set $\{1,\ldots, k\}$ of $k$ colors. Nodes represent players and edges capture their mutual interests. The stra
Externí odkaz:
http://arxiv.org/abs/1810.09278
Autor:
Bilò, Vittorio, Caragiannis, Ioannis, Flammini, Michele, Igarashi, Ayumi, Monaco, Gianpiero, Peters, Dominik, Vinci, Cosimo, Zwicker, William S.
Publikováno v:
Games and Economic Behavior, 131:197-221, 2022
We study the existence of allocations of indivisible goods that are envy-free up to one good (EF1), under the additional constraint that each bundle needs to be connected in an underlying item graph. If the graph is a path and the utility functions a
Externí odkaz:
http://arxiv.org/abs/1808.09406
In this paper we consider a generalization of the well-known budgeted maximum coverage problem. We are given a ground set of elements and a set of bins. The goal is to find a subset of elements along with an associated set of bins, such that the over
Externí odkaz:
http://arxiv.org/abs/1808.03085
In coalition formation games self-organized coalitions are created as a result of the strategic interactions of independent agents. For each couple of agents $(i,j)$, weight $w_{i,j}=w_{j,i}$ reflects how much agents $i$ and $j$ benefit from belongin
Externí odkaz:
http://arxiv.org/abs/1804.05040
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 same color. A
Externí odkaz:
http://arxiv.org/abs/1711.03570
Additively separable hedonic games and fractional hedonic games have received considerable attention. They are coalition forming games of selfish agents based on their mutual preferences. Most of the work in the literature characterizes the existence
Externí odkaz:
http://arxiv.org/abs/1706.09007
Autor:
Bilò, Vittorio, Caragiannis, Ioannis, Flammini, Michele, Igarashi, Ayumi, Monaco, Gianpiero, Peters, Dominik, Vinci, Cosimo, Zwicker, William S.
Publikováno v:
In Games and Economic Behavior January 2022 131:197-221
Publikováno v:
In Information and Computation December 2021 281
Motivated by many practical applications, in this paper we study {\em budget feasible mechanisms} where the goal is to procure independent sets from matroids. More specifically, we are given a matroid $\mathcal{M}=(E,\mathcal{I})$ where each ground (
Externí odkaz:
http://arxiv.org/abs/1612.03150