Matches in DBpedia 2015-10 for { ?s ?p "Blotto games (or Colonel Blotto games, or "Divide a Dollar" games) constitute a class of two-person zero-sum games in which the players are tasked to simultaneously distribute limited resources over several objects (or battlefields). In the classic version of the game, the player devoting the most resources to a battlefield wins that battlefield, and the gain (or payoff) is then equal to the total number of battlefields won.The Colonel Blotto game was first proposed and solved by Émile Borel in 1921, as an example of a game in which "the psychology of the players matters". It was studied after the Second World War by scholars in Operation Research, and became a classic in Game Theory.The game is named after the fictional Colonel Blotto from Gross and Wagner's 1950 paper. The Colonel was tasked with finding the optimum distribution of his soldiers over N battlefields knowing that: on each battlefield the party that has allocated the most soldiers will win, but both parties do not know how many soldiers the opposing party will allocate to each battlefield, and: both parties seek to maximize the number of battlefields they expect to win.↑ ↑ ↑"@en }
Showing triples 1 to 1 of
1
with 100 triples per page.
- Blotto_games abstract "Blotto games (or Colonel Blotto games, or "Divide a Dollar" games) constitute a class of two-person zero-sum games in which the players are tasked to simultaneously distribute limited resources over several objects (or battlefields). In the classic version of the game, the player devoting the most resources to a battlefield wins that battlefield, and the gain (or payoff) is then equal to the total number of battlefields won.The Colonel Blotto game was first proposed and solved by Émile Borel in 1921, as an example of a game in which "the psychology of the players matters". It was studied after the Second World War by scholars in Operation Research, and became a classic in Game Theory.The game is named after the fictional Colonel Blotto from Gross and Wagner's 1950 paper. The Colonel was tasked with finding the optimum distribution of his soldiers over N battlefields knowing that: on each battlefield the party that has allocated the most soldiers will win, but both parties do not know how many soldiers the opposing party will allocate to each battlefield, and: both parties seek to maximize the number of battlefields they expect to win.↑ ↑ ↑".