3 citations · 4 across the 5 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.PL2020
Proving Almost-Sure Termination of Probabilistic Programs via Incremental Pruning
Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný +2
The extension of classical imperative programs with real-valued random variables and random branching gives rise to probabilistic programs. The termination problem is one of the mo…
econ.TH2020
Infinite-Duration All-Pay Bidding Games
Guy Avni, Ismaël Jecker, Đorđe Žikelić
In a two-player zero-sum graph game the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the p…