相关论文: Quid Pro Quo allocations in Production-Inventory g…

Production-inventory games were introduced in Guardiola et al. (2007) as a new class of totally balanced combinatorial optimization games. From among all core-allocations, the Owen point was proposed as a specifically appealing solution. In…

In this paper we introduce a new class of cooperative games that arise from production-inventory problems. Several agents have to cover their demand over a finite time horizon and shortages are allowed. Each agent has its own unit…

We study fair allocation of profit (or cost) for three central problems from combinatorial optimization: Max-Flow, MST and $b$-matching. The essentially unequivocal choice of solution concept for this purpose would be the core, because of…

Classical objectives in two-player zero-sum games played on graphs often deal with limit behaviors of infinite plays: e.g., mean-payoff and total-payoff in the quantitative setting, or parity in the qualitative one (a canonical way to…

The core is a central solution concept in cooperative game theory, defined as the set of feasible allocations or payments such that no subset of agents has incentive to break away and form their own subgroup or coalition. However, it has…

In this dissertation, we analyze the computational properties of game-theoretic centrality measures. The key idea behind game-theoretic approach to network analysis is to treat nodes as players in a cooperative game, where the value of each…

Cooperative lot-sizing models with backlogging and heterogeneous costs are studied in Guardiola et al. (2020). In this model several firms participate in a consortium aiming at satisfying their demand over the planing horizon with minimal…

Concurrent multi-player mean-payoff games are important models for systems of agents with individual, non-dichotomous preferences. Whilst these games have been extensively studied in terms of their equilibria in non-cooperative settings,…

The core is a dominant solution concept in economics and cooperative game theory; it is predominantly used for profit, equivalently cost or utility, sharing. This paper demonstrates the versatility of this notion by proposing a completely…

Classical objectives in two-player zero-sum games played on graphs often deal with limit behaviors of infinite plays: e.g., mean-payoff and total-payoff in the quantitative setting, or parity in the qualitative one (a canonical way to…

We examine two-player games over finite weighted graphs with quantitative (mean-payoff or energy) objective, where one of the players additionally needs to satisfy a fairness objective. The specific fairness we consider is called 'strong…

The core is a quintessential solution concept for profit sharing in cooperative game theory. An imputation allocates the worth of the given game among its agents. The imputation lies in the core of the game if, for each sub-coalition, the…

In cooperative game theory, the primary focus is the equitable allocation of payoffs or costs among agents. However, in the practical applications of cooperative games, accurately representing games is challenging. In such cases, using an…

Coalitional games are mathematical models suited to analyze scenarios where players can collaborate by forming coalitions in order to obtain higher worths than by acting in isolation. A fundamental problem for coalitional games is to single…

The core of a game $v$ on $N$, which is the set of additive games $\phi$ dominating $v$ such that $\phi(N)=v(N)$, is a central notion in cooperative game theory, decision making and in combinatorics, where it is related to submodular…

Big Boss Games represent a specific class of cooperative games where a single veto player, known as the Big Boss, plays a central role in determining resource allocation and maintaining coalition stability. In this paper, we introduce a…

$\omega$-regular energy games, which are weighted two-player turn-based games with the quantitative objective to keep the energy levels non-negative, have been used in the context of verification and synthesis. The logic of modal…

Following the work of Lloyd Shapley on the Shapley value, and tangentially the work of Guillermo Owen, we offer an alternative non-probabilistic formulation of part of the work of Robert J. Weber in his 1978 paper "Probabilistic values for…

This paper provides formulae and algorithms to compute the projection onto the core of a preimputation outside it. The core of a game is described using an exponential number of linear constraints, and we cannot know beforehand which are…

While discounted payoff games and classic games that reduce to them, like parity and mean-payoff games, are symmetric, their solutions are not. We have taken a fresh view on the properties that optimal solutions need to have, and devised a…