Results 1 to 10 of about 1,335 (259)
A decomposition resolution approach for a production-inventory-distribution-routing problem
Exacta, 2021 The aim of this study is to develop a solution to the problem of distribution of goods proposed by the Mathematical Competitive Game 2017-2018, jointly organized by the French Federation of Mathematical Games and Mathematical Modelling Company.
William de Paula Ferreira +2 more
doaj +1 more source
The Electronic Journal of CombinatoricsCombinatorial Game Theory is a branch of mathematics and theoretical computer science that studies sequential 2-player games with perfect information. Normal play is the convention where a player who cannot move loses. Here, we generalize the classical alternating normal play to infinitely many game families, by means of discrete Richman auctions ...
Prem Kant +3 more
openaire +5 more sources
Leveraging Possibilistic Beliefs in Unrestricted Combinatorial Auctions
Games, 2016 In unrestricted combinatorial auctions, we put forward a mechanism that guarantees a meaningful revenue benchmark based on the possibilistic beliefs that the players have about each other’s valuations.
Jing Chen, Silvio Micali
doaj +1 more source
Combinatorial games on a graph
Discrete Mathematics, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Interactive Ant Colony Optimization to Support Adaptation in Serious Games
International Journal of Serious Games, 2019 The success of serious games usually depends on their capabilities to engage learners and to provide them with personalized gaming and learning experiences.
Michael Kickmeier-Rust +1 more
doaj +1 more source
Study on the Optimal Strategy of Missile Interception
IEEE Access, 2021 Missiles have been playing an important role in modern wars. In order to gain advantage in missile contests, the technology of missile interception have been developed for many years. However, constrained by current technology, it is still very difficult
Kaiye Gao, Xiangbin Yan
doaj +1 more source
Extremal properties of flood-filling games [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 The problem of determining the number of "flooding operations" required to make a given coloured graph monochromatic in the one-player combinatorial game Flood-It has been studied extensively from an algorithmic point of view, but basic questions about ...
Kitty Meeks, Dominik K. Vu
doaj +1 more source
Combinatorial Aspects of the Card Game War
Australas. J Comb., 2022 This paper studies a single-suit version of the card game War on a finite deck of cards. There are varying methods of how players put the cards that they win back into their hands, but we primarily consider randomly putting the cards back and deterministically always putting the winning card before the losing card.
Tanya Khovanova, Atharva Pathak
openaire +4 more sources
Remarks on strategies in combinatorial games
Discrete Applied Mathematics, 1985 Viewing strategies in combinatorial games as a relation \(S\subset X\times X\) where X is the set of states (instead of a mapping \(S: X\to X)\) the authors give: 1) a very short proof of the existence of a loss-preventing strategy, 2) a proof of the existence of a winning strategy without the axiom of choice, and 3) a proof of the theorem on the value
Ales Pultr, J. Úlehla
openaire +3 more sources
From Nash Equilibria to Chain Recurrent Sets: An Algorithmic Solution Concept for Game Theory
Entropy, 2018 In 1950, Nash proposed a natural equilibrium solution concept for games hence called Nash equilibrium, and proved that all finite games have at least one.
Christos Papadimitriou +1 more
doaj +1 more source