- Applied mathematics
- >
- Mathematical economics
- >
- Game theory
- >
- Cooperative games

- Mathematics
- >
- Fields of mathematics
- >
- Game theory
- >
- Cooperative games

Stable marriage problem

In mathematics, economics, and computer science, the stable marriage problem (also stable matching problem or SMP) is the problem of finding a stable matching between two equally sized sets of element

Bargaining

In the social sciences, bargaining or haggling is a type of negotiation in which the buyer and seller of a good or service debate the price or nature of a transaction. If the bargaining produces agree

Cooperative board game

Cooperative board games are board games in which players work together to achieve a common goal rather than competing against each other. Either the players win the game by reaching a pre-determined o

Shapley value

The Shapley value is a solution concept in cooperative game theory. It was named in honor of Lloyd Shapley, who introduced it in 1951 and won the Nobel Memorial Prize in Economic Sciences for it in 20

Marvel Champions: The Card Game

Marvel Champions: The Card Game is a cooperative, living card game published by Fantasy Flight Games. Players control decks representing heroes from the Marvel Universe, and work together to defeat a

Cooperative bargaining

Cooperative bargaining is a process in which two people decide how to share a surplus that they can jointly generate. In many cases, the surplus created by the two players can be shared in many ways,

Shapley–Shubik power index

The Shapley–Shubik power index was formulated by Lloyd Shapley and Martin Shubik in 1954 to measure the powers of players in a voting game. The index often reveals surprising power distribution that i

Cooperative game theory

In game theory, a cooperative game (or coalitional game) is a game with competition between groups of players ("coalitions") due to the possibility of external enforcement of cooperative behavior (e.g

Deterministic rendezvous problem

The deterministic rendezvous problem is a variant of the rendezvous problem where the players, or robots, must find each other by following a deterministic sequence of instructions. Although each robo

Stable roommates problem

In mathematics, economics and computer science, particularly in the fields of combinatorics, game theory and algorithms, the stable-roommate problem (SRP) is the problem of finding a stable matching f

Core (game theory)

In cooperative game theory, the core is the set of feasible allocations that cannot be improved upon by a subset (a coalition) of the economy's agents. A coalition is said to improve upon or block a f

Bondareva–Shapley theorem

The Bondareva–Shapley theorem, in game theory, describes a necessary and sufficient condition for the non-emptiness of the core of a cooperative game in characteristic function form. Specifically, the

Bargaining power

Bargaining power is the relative ability of parties in an argumentative situation (such as bargaining, contract writing, or making an agreement) to exert influence over each other. If both parties are

Airport problem

In mathematics and especially game theory, the airport problem is a type of fair division problem in which it is decided how to distribute the cost of an airport runway among different players who nee

Rendezvous problem

The rendezvous dilemma is a logical dilemma, typically formulated in this way: Two people have a date in a park they have never been to before. Arriving separately in the park, they are both surprised

The Smurfs: Mission Vileaf

The Smurfs: Mission Vileaf (French: Les Schtroumpfs: Mission Malfeuille) is a platform video game developed by OSome Studio and published by Microids, released on October 26, 2021. This video game was

Facility location (cooperative game)

The cooperative facility location game is a cooperative game of cost sharing. The goal is to share the cost of opening new facilities between the clients enjoying these facilities.The game has the fol

Entitlement (fair division)

Entitlement in fair division describes that proportion of the resources or goods to be divided that a player can expect to receive. In many fair division settings, all agents have equal entitlements,

Linear production game

Linear production game (LP Game) is a N-person game in which the value of a coalition can be obtained by solving a linear programming problem. It is widely used in the context of resource allocation a

Authority distribution

The solution concept authority distribution was formulated by Lloyd Shapley and his student X. Hu in 2003 to measure the authority power of players in a well-contracted organization. The index generat

Imputation (game theory)

In fully cooperative games players will opt to form coalitions when the value of the payoff is equal to or greater than if they were to work alone. The focus of the game is to find acceptable distribu

Irrigation game

Irrigation games are cooperative games which model cost sharing problems on networks (more precisely, on rooted trees). The irrigation game is a transferable utility game assigned to a cost-tree probl

KKMS theorem

No description available.

Banzhaf power index

The Banzhaf power index, named after John F. Banzhaf III (originally invented by Lionel Penrose in 1946 and sometimes called Penrose–Banzhaf index; also known as the Banzhaf–Coleman index after James

Mage Knight Board Game

Mage Knight Board Game is a cooperative board game for 1 to 4 players designed by Vlaada Chvátil and released in November 2011. It is based on the related collectable miniatures game, Mage Knight. It

Nakamura number

In cooperative game theory and social choice theory, the Nakamura number measures the degree of rationalityof preference aggregation rules (collective decision rules), such as voting rules.It is an in

© 2023 Useful Links.