_id,title
1182,Robust draws in balanced knockout tournaments
1200,"Only the combination of mathematics and agent based simulations can leverage the full potential of evolutionary modeling: Comment on “Evolutionary game theory using agent-based methods” by C. Adami, J. Schossau and A. Hintze"
1245,Game-theoretic models identify useful principles for peer collaboration in online learning platforms
1322,Asymmetric power boosts extortion in an economic experiment
1324,Indefinite-horizon reachability in Goal-DEC-POMDPs
1325,Stability in graphs and games
1326,Optimizing the expected mean payoff in Energy Markov Decision Processes
1327,Stochastic shortest path with energy constraints in POMDPs
1333,Humans choose representatives who enforce cooperation in social dilemmas through extortion
1335,Quantitative monitor automata
1340,The big match in small space
1380,On the complexity of the orbit problem
1386,Termination analysis of probabilistic programs through Positivstellensatz's
1389,On recurrent reachability for continuous linear dynamical systems
1397,Algorithms for partially observable markov decision processes
1423,Comparing reactive and memory-one strategies of direct reciprocity
1426,Coevolutionary interactions between farmers and mafia induce host acceptance of avian brood parasites
1437,Algorithms for algebraic path properties in concurrent systems of constant treewidth components
1438,Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
1477,"What is decidable about partially observable Markov decision processes with ω-regular objectives"
1518,Efficient strategies for calculating blockwise likelihoods under the coalescent
1529,Optimal cost almost-sure reachability in POMDPs
1068,Conditionally optimal algorithms for generalized Büchi Games
1069,On the skolem problem for continuous linear dynamical systems
1070,Computation tree logic for synchronization properties
1071,Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs
1090,Nested weighted limit-average automata of bounded width
1093,Linear distances between Markov chains
1138,Quantitative automata under probabilistic semantics
1140,Model and objective separation with conditional lower bounds disjunction is harder than conjunction
1166,A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps
2034,Probabilistic opacity for Markov decision processes
523,Looking at mean-payoff and total-payoff through windows
524,Qualitative analysis of concurrent mean payoff games
5429,Unifying two views on multiple mean-payoff objectives in Markov decision processes
5430,Faster algorithms for quantitative verification in constant treewidth graphs
5431,The patience of concurrent stochastic games with safety and reachability objectives
5432,The complexity of evolutionary games on graphs
5435,Unifying two views on multiple mean-payoff objectives in Markov decision processes
5436,Nested weighted automata
5437,Faster algorithms for quantitative verification in constant treewidth graphs
5438,Edit distance for pushdown automata
5440,The complexity of evolutionary games on graphs
5441,Algorithms for algebraic path properties in concurrent systems of constant treewidth components
5443,A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs
5444,Reconstructing robust phylogenies of metastatic cancers
5549,Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes
1559,Computational complexity of ecological and evolutionary spatial dynamics
1594,Controller synthesis for MDPs and frequency LTL\GU
1598,Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives
1601,The Hanoi omega-automata format
1602,Faster algorithms for algebraic path properties in recursive state machines with constant treewidth
1603,Counterexample explanation by learning small strategies in Markov decision processes
1604,Quantitative interprocedural analysis
1607,Faster algorithms for quantitative verification in constant treewidth graphs
1609,The complexity of synthesis from probabilistic components
1610,Edit distance for pushdown automata
1624,Cellular cooperation with shift updating and repulsion
1656,Nested weighted automata
1657,Unifying two views on multiple mean-payoff objectives in Markov decision processes
1660,Long-run average behaviour of probabilistic vector addition systems
1661,Improved algorithms for one-pair and k-pair Streett objectives
1665,Mutations driving CLL and their evolution in progression and relapse
1667,Optimizing performance of continuous-time stochastic systems using timeout synthesis
1673,Amplifiers of selection
1681,Evolution of decisions in population games with sequentially searching individuals
1689,Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
1691,Temporal logic motion planning using POMDPs with parity objectives: Case study paper
1694,Quantitative temporal simulation and refinement distances for timed systems
1698,The complexity of multi-mean-payoff and multi-energy games
1709,Biological auctions with multiple rewards
1714,A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks
1731,Randomness for free
1732,Qualitative analysis of POMDPs with temporal logic specifications for robotics applications
1820,Optimal cost almost-sure reachability in POMDPs
1838,Assume-guarantee synthesis for concurrent reactive programs with partial information
1839,Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives
1846,Refinement checking on parametric modal transition systems
1851,Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating
1856,Measuring and synthesizing systems in probabilistic environments
1873,POMDPs under probabilistic semantics
1882,Compositionality for quantitative specifications
1400,The subclonal evolution of cancer
1481,Automatic generation of alternative starting positions for simple traditional board games
1499,Polynomial time decidability of weighted synchronization under partial observability
1501,CEGAR for compositional analysis of qualitative properties in Markov decision processes
1502,Complete composition operators for IOCO-testing theory
2027,Verification of markov decision processes using learning algorithms
2038,Temporal specifications with accumulative values
2039,The time scale of evolutionary innovation
2052,Parameterized model checking of rendezvous systems
2053,Probabilistic bisimulation: Naturally on distributions
2054,Qualitative concurrent parity games: Bounded rationality
2063,CEGAR for qualitative analysis of probabilistic systems
2141,Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition
2162,The complexity of ergodic mean payoff games
2163,Games with a weak adversary
2187,Synthesizing robust systems
2190,From LTL to deterministic automata: A safraless compositional approach
2211,Partial-observation stochastic games: How to win when belief fails