Search results

...ing for the [[fair division]] of the costs among the users. The irrigation games are mentioned first by [[#Aadland|Aadland and Kolpin 1998]], but the forma ...players (the vertices but the root). Consider an <math>S\subseteq N</math> non-empty coalition, then the cost of connecting the players of <math>S</math> ...

...-1822-2}}</ref><ref name=agt>Eva Tardos and Tom Wexler, "Network Formation Games". Chapter 19 in {{Cite Algorithmic Game Theory 2007}}</ref>{{rp|502-506}} T ...10.1007/978-3-540-27821-4_17|chapter= Convergence Issues in Competitive Games|title= Approximation, Randomization, and Combinatorial Optimization. Alg ...

Consider a standard [[non-cooperative game]] with ''n'' players, where <math> S_i \subseteq \mathbb{R} </math> is In words, payoff functions in aggregative games depend on players' ''own strategies'' and the ''aggregate'' <math>\sum s_j< ...

{{Short description|Solution in cooperative games}} In [[cooperative game theory]], the '''nucleolus''' of a cooperative game is the [[Solution concept|solution]] (i.e., allocation of payments to ...

In the mathematical [[game theory|theory of games]], in particular the study of [[zero-sum]] [[continuous game]]s, not every ...| last2 = Wolfe | pages = 299–306 | title = Contributions to the Theory of Games III | editor1-first = M. | editor1-last = Dresher | editor2-first = A. W. | ...

...game ''v'' is a [[totally balanced game]]. So every subgame of ''v'' has a non-empty [[Core (game theory)|core]]. One [[imputation (game theory)|imputatio ...| last1=OWEN | first1=Guillermo | title=[[On the Core of Linear Production Games]] | publisher=[[Mathematical Programming ]] | year=1975 | journal=Mathemati ...

{{short description|Solution concept for non-cooperative games}} ...bility''' is a [[solution concept]] used to predict the outcome of a [[non-cooperative game]]. A tentative definition of stability was proposed by Elon Kohlberg a ...

...pture a type of [[altruism]] rather than purely [[non-cooperative game|non-cooperative play]]. Whereas a Nash equilibrium is a situation in which each player of a ...t2=Rabia |last2=Nessah |first3=Tarik |last3=Tazdaït |title=How to play the games? Nash versus Berge behavior rules |journal=Economics & Philosophy |volume=3 ...

{{Short description|Solution Concept for Noncooperative games}} | supersetof = [[Non-cooperative game theory]] ...

...his distinguishes them from turn-based games ([[Sequential game|sequential games]]) like chess, focusing instead on real-time strategic conflicts. ...9781611971132}}</ref> While the two overlap significantly, continuous-time games also encompass models not governed by differential equations, such as those ...

...th this is to restrict both players' sets of available programs to prevent non-halting programs.<ref name="Tennenholtz2004" /><ref name="Oesterheld2019" / == Different mechanisms for achieving cooperative program equilibrium in the Prisoner's Dilemma == ...

'''Job scheduling games''' are the following set of problems: given <math> M </math> machines and < ...ce of stability is used to measure inefficiency. It differentiates between games in which all equilibria are inefficient and those in which there exists an ...

In [[cooperative game theory]] and [[social choice theory]], the '''Nakamura number''' measu A Nakamura number can be assigned to such collections, which we call ''simple games''. ...

'''Cooperative bargaining''' is a process in which two people decide how to share a surplu ...rous occasions.<ref>{{Citation|last=Thomson|first=William|title=Chapter 35 Cooperative models of bargaining|date=1994-01-01|url=https://www.sciencedirect.com/scie ...

...1. The first {{math|1=''m''}} constraints require the probabilities to be non-negative, and the other {{math|1=''n''}} constraints require each of the {{ ...response to {{math|1=''g''}} with probability 1. Consider the continuum of games in which {{math|1=''B''}} is continuously reduced to 0. There exists a path ...

In [[cooperative game theory]], a '''hedonic game'''<ref name=":0" /><ref name=":3"> Haris Aziz and Rahul Savani, "Hedonic Games". Chapter 15 in: {{Cite ComSoc Handbook 2016}}</ref> (also known as a hedon ...

...brium]]<br/>[[Hierarchy of beliefs]]<br/>[[Stochastic games]]<br/>Repeated games with incomplete information<br/>[[Shapley value]] ...r, and refinements of [[Nash equilibrium]] (see [[solution concept]]). In cooperative game theory he contributed to the solution concepts called the [[Core (game ...

...ogue partners" of the MRC and the six countries now work together within a cooperative framework. ...es}}</ref> study this question using axioms from [[Cooperative game theory|cooperative game]] theory. ...

...ov Samet |title=Approximating common knowledge with common beliefs|journal=Games and Economic Behavior|year=1989|doi=10.1016/0899-8256(89)90017-1}}</ref> Th Nielsen extended the theorem to non-discrete models in which knowledge is described by <math>\sigma</math>-alge ...

...an | last2 = Wu | first2 = Yi | title = Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environments | eprint = 1706.02275v4 | year = 2020 | class = cs ...partially observable Markov decision process|decentralized POMDP]] in the cooperative case. ...