English
Related papers

Related papers: Simulation leagues: Analysis of competition format…

200 papers

Predicting the results of sport matches and competitions is an arising research field, benefiting from the growing amount of available data and the novel data analytics techniques. Excellent forecasts can be achieved by advanced machine…

Applications · Statistics 2015-11-20 Giuseppe Jurman

Recent computer simulations of the competition between thousands of languages are reviewed, and some new results on language families and language similarities are presented.

Physics and Society · Physics 2007-05-23 D. Stauffer , C. Schulze , S. Wichmann

A $p$-beauty contest is a wide class of games of guessing the most popular strategy among other players. In particular, guessing a fraction of a mean of numbers chosen by all players is a classic behavioral experiment designed to test…

General Economics · Economics 2025-10-23 Iuliia Alekseenko , Dmitry Dagaev , Sofia Paklina , Petr Parshakov

This paper presents a novel framework for cooperative robotics competitions (coopetitions) that promote the transferability and composability of robotics modules, including software, hardware, and data, across heterogeneous robotic systems.…

We describe Gliders2d, a base code release for Gliders, a soccer simulation team which won the RoboCup Soccer 2D Simulation League in 2016. We trace six evolutionary steps, each of which is encapsulated in a sequential change of the…

Multiagent Systems · Computer Science 2018-12-27 Mikhail Prokopenko , Peter Wang

The group stage of a sports tournament is often made more appealing by introducing additional constraints in the group draw that promote an attractive and balanced group composition. For example, the number of intra-regional group matches…

Applications · Statistics 2026-02-25 László Csató , Martin Becker , Karel Devriesere , Dries Goossens

Many sports tournaments are organised in a hybrid design consisting of a round-robin group stage followed by a knock-out phase. The traditional seeding regime aims to create balanced groups roughly at the same competition level but may…

Applications · Statistics 2020-08-26 László Csató

We consider a two-round election model involving $m$ voters and $n$ candidates. Each voter is endowed with a strict preference list ranking the candidates. In the first round, the candidates are partitioned into two subsets, $A$ and $B$,…

Computer Science and Game Theory · Computer Science 2026-03-17 Emilio De Santis , Antonio Di Crescenzo , Verdiana Mustaro

We form a "map of tournaments" by adapting the map framework from the world of elections. By a tournament we mean a complete directed graph where the nodes are the players and an edge points from a winner of a game to the loser (with no…

Computer Science and Game Theory · Computer Science 2026-01-27 Filip Nikolow , Piotr Faliszewski , Stanisław Szufa

The group draw of a sports tournament requires assigning teams to groups of (almost) the same size. The most important criteria for a draw procedure are balance, randomness, and transparency, which could not be satisfied simultaneously if…

Physics and Society · Physics 2026-05-25 László Csató

Knockout tournaments, also known as single-elimination or cup tournaments, are a popular form of sports competitions. In the standard probabilistic setting, for each pairing of players, one of the players wins the game with a certain (a…

Data Structures and Algorithms · Computer Science 2024-12-17 Juhi Chaudhary , Hendrik Molter , Meirav Zehavi

Determining the number of algorithm runs is a critical aspect of experimental design, as it directly influences the experiment's duration and the reliability of its outcomes. This paper introduces an empirical approach to estimating the…

Neural and Evolutionary Computing · Computer Science 2025-07-03 Tome Eftimov , Peter Korošec

A bidimensional representation of the space of 2x2 Symmetric Games in the strategic representation is proposed. This representation provides a tool for the classification of 2x2 symmetric games, quantification of the fraction of them having…

Computer Science and Game Theory · Computer Science 2007-05-23 Alvaro Francisco Huertas-Rosero

Online competitive games have become increasingly popular. To ensure an exciting and competitive environment, these games routinely attempt to match players with similar skill levels. Matching players is often accomplished through a rating…

Information Retrieval · Computer Science 2020-08-18 Arman Dehpanah , Muheeb Faizan Ghori , Jonathan Gemmell , Bamshad Mobasher

Recent advancements in algorithms for sequential decision-making under imperfect information have shown remarkable success in large games such as limit- and no-limit poker. These algorithms traditionally formalize the games using the…

Computer Science and Game Theory · Computer Science 2023-12-07 Vojtěch Kovařík , David Milec , Michal Šustr , Dominik Seitz , Viliam Lisý

This paper coins the notion of Joker games, a variant of concurrent games where the players are not strictly adversarial. Instead, Player 1 can get help from Player 2 by playing a Joker move. We formalize these games as cost games and…

Computer Science and Game Theory · Computer Science 2025-03-26 Petra van den Bos , Marielle Stoelinga

The goal of this project is to predict the opponent's configuration in a RoboCup SSL environment. For simplicity, a Markov model assumption is made such that the predicted formation of the opponent team only depends on its current…

Artificial Intelligence · Computer Science 2015-03-05 Selene Baez

Sports data has become widely available in the recent past. With the improvement of machine learning techniques, there have been attempts to use sports data to analyze not only the outcome of individual games but also to improve insights…

Artificial Intelligence · Computer Science 2020-07-21 Ashwin Vaswani , Rijul Ganguly , Het Shah , Sharan Ranjit S , Shrey Pandit , Samruddhi Bothara

Writing competitive programming problems is exacting. Authors must: set constraints, input distributions, and edge cases that rule out shortcuts; target specific algorithms (e.g., max-flow, dynamic programming, data structures); and…

A tournament organizer must select one of $n$ possible teams as the winner of a competition after observing all $\binom{n}{2}$ matches between them. The organizer would like to find a tournament rule that simultaneously satisfies the…

Computer Science and Game Theory · Computer Science 2024-07-26 David Mikšaník , Ariel Schvartzman , Jan Soukup
‹ Prev 1 4 5 6 7 8 10 Next ›