Quantitative Reductions and Vertex-Ranked Infinite Games
We introduce quantitative reductions, a novel technique for structuring the space of quantitative games and solving them that does not rely on a reduction to qualitative games. We show that such reductions exhibit the same desirable properties as their qualitative counterparts and additionally retai...
Main Author: | Alexander Weinert |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2018-09-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1809.03887v1 |
Similar Items
-
Vertex Ranking of Graphs
by: Nancy N.H. Teng, et al.
Published: (2007) -
Vertex Ranking Number of Graphs
by: Shing-Ching Lin, et al.
Published: (2008) -
On Vertex Ranking And Related Problem Of Graphs
by: Yi-Ming Chen, et al.
Published: (2009) -
Vertex Sparsification and Oblivious Reductions
by: Moitra, Ankur
Published: (2014) -
A study of vertex operator constructions for some infinite dimensional lie algebras
by: Tan, Shaobin
Published: (1998)