2,244 research outputs found
Voronoi Choice Games
We study novel variations of Voronoi games and associated random processes
that we call Voronoi choice games. These games provide a rich framework for
studying questions regarding the power of small numbers of choices in
multi-player, competitive scenarios, and they further lead to many interesting,
non-trivial random processes that appear worthy of study.
As an example of the type of problem we study, suppose a group of miners
are staking land claims through the following process: each miner has
associated points independently and uniformly distributed on an underlying
space, so the th miner will have associated points
. Each miner chooses one of these points as the
base point for their claim. Each miner obtains mining rights for the area of
the square that is closest to their chosen base, that is, they obtain the
Voronoi cell corresponding to their chosen point in the Voronoi diagram of the
chosen points. Each player's goal is simply to maximize the amount of land
under their control. What can we say about the players' strategy and the
equilibria of such games?
In our main result, we derive bounds on the expected number of pure Nash
equilibria for a variation of the 1-dimensional game on the circle where a
player owns the arc starting from their point and moving clockwise to the next
point. This result uses interesting properties of random arc lengths on
circles, and demonstrates the challenges in analyzing these kinds of problems.
We also provide several other related results. In particular, for the
1-dimensional game on the circle, we show that a pure Nash equilibrium always
exists when each player owns the part of the circle nearest to their point, but
it is NP-hard to determine whether a pure Nash equilibrium exists in the
variant when each player owns the arc starting from their point clockwise to
the next point
The riddle of togelby
© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.At the 2017 Artificial and Computational Intelligence in Games meeting at Dagstuhl, Julian Togelius asked how to make spaces where every way of filling in the details yielded a good game. This study examines the possibility of enriching search spaces so that they contain very high rates of interesting objects, specifically game elements. While we do not answer the full challenge of finding good games throughout the space, this study highlights a number of potential avenues. These include naturally rich spaces, a simple technique for modifying a representation to search only rich parts of a larger search space, and representations that are highly expressive and so exhibit highly restricted and consequently enriched search spaces. We treat the creation of plausible road systems, useful graphics, highly expressive room placement for maps, generation of cavern-like maps, and combinatorial puzzle spaces.Final Accepted Versio
Voronoi languages: Equilibria in cheap-talk games with high-dimensional types and few signals
We study a communication game of common interest in which the sender observes one of infinite types and sends one of finite messages which is interpreted by the receiver. In equilibrium there is no full separation but types are clustered into convex categories. We give a full characterization of the strict Nash equilibria of this game by representing these categories by Voronoi languages. As the strategy set is infinite static stability concepts for finite games such as ESS are no longer sufficient for Lyapunov stability in the replicator dynamics. We give examples of unstable strict Nash equilibria and stable inefficient Voronoi Languages. We derive efficient Voronoi languages with a large number of categories and numerically illustrate stability of some Voronoi languages with large message spaces and non-uniformly distributed types.Cheap Talk, Signaling Game, Communication Game, Dynamic stability, Voronoi tesselation
Learning Convex Partitions and Computing Game-theoretic Equilibria from Best Response Queries
Suppose that an -simplex is partitioned into convex regions having
disjoint interiors and distinct labels, and we may learn the label of any point
by querying it. The learning objective is to know, for any point in the
simplex, a label that occurs within some distance from that point.
We present two algorithms for this task: Constant-Dimension Generalised Binary
Search (CD-GBS), which for constant uses queries, and Constant-Region Generalised Binary
Search (CR-GBS), which uses CD-GBS as a subroutine and for constant uses
queries.
We show via Kakutani's fixed-point theorem that these algorithms provide
bounds on the best-response query complexity of computing approximate
well-supported equilibria of bimatrix games in which one of the players has a
constant number of pure strategies. We also partially extend our results to
games with multiple players, establishing further query complexity bounds for
computing approximate well-supported equilibria in this setting.Comment: 38 pages, 7 figures, second version strengthens lower bound in
Theorem 6, adds footnotes with additional comments and fixes typo
Coverage and Connectivity in Three-Dimensional Networks
Most wireless terrestrial networks are designed based on the assumption that
the nodes are deployed on a two-dimensional (2D) plane. However, this 2D
assumption is not valid in underwater, atmospheric, or space communications. In
fact, recent interest in underwater acoustic ad hoc and sensor networks hints
at the need to understand how to design networks in 3D. Unfortunately, the
design of 3D networks is surprisingly more difficult than the design of 2D
networks. For example, proofs of Kelvin's conjecture and Kepler's conjecture
required centuries of research to achieve breakthroughs, whereas their 2D
counterparts are trivial to solve. In this paper, we consider the coverage and
connectivity issues of 3D networks, where the goal is to find a node placement
strategy with 100% sensing coverage of a 3D space, while minimizing the number
of nodes required for surveillance. Our results indicate that the use of the
Voronoi tessellation of 3D space to create truncated octahedral cells results
in the best strategy. In this truncated octahedron placement strategy, the
transmission range must be at least 1.7889 times the sensing range in order to
maintain connectivity among nodes. If the transmission range is between 1.4142
and 1.7889 times the sensing range, then a hexagonal prism placement strategy
or a rhombic dodecahedron placement strategy should be used. Although the
required number of nodes in the hexagonal prism and the rhombic dodecahedron
placement strategies is the same, this number is 43.25% higher than the number
of nodes required by the truncated octahedron placement strategy. We verify by
simulation that our placement strategies indeed guarantee ubiquitous coverage.
We believe that our approach and our results presented in this paper could be
used for extending the processes of 2D network design to 3D networks.Comment: To appear in ACM Mobicom 200
- …