Search results
Jump to navigation
Jump to search
- ...|first1=Roger |author1-link=Roger Myerson |title=Graphs and Cooperation in Games |journal=Mathematics of Operations Research |date=1977 |volume=2 |issue=3 | === Cooperative games === ...7 KB (1,172 words) - 07:21, 17 February 2025
- ...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 ...per subset of the finite convex cone spanned by the duals of the unanimity games, therefore every irrigation game is concave. ...5 KB (776 words) - 16:09, 3 December 2024
- ...-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 ...5 KB (764 words) - 18:43, 4 January 2024
- 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< ...6 KB (889 words) - 23:49, 15 August 2023
- {{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 ...15 KB (2,227 words) - 03:28, 23 February 2025
- ...ionary perspectives and, as mentioned above, (iii) the SSG subgroup of 2×2 games. ...ribed by a 2 × 2 payoff matrix that allows each player to choose between a cooperative and a competitive (or defective) move. If both players cooperate, each play ...11 KB (1,743 words) - 01:16, 8 May 2022
- 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. | ...5 KB (801 words) - 17:00, 9 September 2022
- ...| last1=OWEN | first1=Guillermo | title=[[On the Core of Linear Production Games]] | publisher=[[Mathematical Programming ]] | year=1975 | journal=Mathemati [[Category:Cooperative games]] ...3 KB (434 words) - 18:42, 25 July 2020
- {{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 ...12 KB (1,690 words) - 18:20, 10 November 2024
- ...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 ...11 KB (1,658 words) - 18:22, 10 November 2024
- ...st4=Sethi |first4=Suresh P. |date=2011-01-01 |title=Retail competition and cooperative advertising |url=https://www.sciencedirect.com/science/article/pii/S0167637 * Competitive model: Nash differential games<ref name="Sorger89" /><ref name="PS04" /><ref name="BKPS05" /><ref name="NP ...15 KB (2,111 words) - 20:35, 26 August 2024
- ...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 ...10 KB (1,311 words) - 20:59, 20 February 2025
- {{Short description|Solution Concept for Noncooperative games}} | supersetof = [[Non-cooperative game theory]] ...24 KB (3,623 words) - 07:02, 23 July 2023
- == Different mechanisms for achieving cooperative program equilibrium in the Prisoner's Dilemma == Various authors have proposed ways to achieve cooperative program equilibrium in the [[Prisoner's Dilemma]]. ...12 KB (1,633 words) - 01:28, 5 September 2024
- '''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 ...6 KB (1,085 words) - 08:16, 12 May 2023
- 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''. ...22 KB (3,435 words) - 04:41, 2 March 2024
- ...th>, we can think of <math>T_i</math> as their [[Bayesian game#Normal form games with incomplete information | Harsanyi type]]. In terms of choice, players [[Category:Cooperative games]] ...6 KB (1,016 words) - 12:44, 8 January 2025
- '''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 ...16 KB (2,280 words) - 12:09, 3 December 2024
- ...he evolutionary system, as in engineering (control theory and differential games) ...ints among many other ones, in connectionist networks and/or cooperative games, in population and social dynamics, in [[neuroscience]]s and some biologica ...6 KB (813 words) - 23:16, 1 January 2023
- ...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 ...through Support Enumeration Methods in Bayesian Two-Player Strategic-Form Games ...12 KB (1,678 words) - 07:36, 10 December 2024