27 papers:
FoSSaCS-2015-Velner #decidability #game studies #multi #robust- Robust Multidimensional Mean-Payoff Games are Undecidable (YV), pp. 312–327.
TACAS-2015-BrazdilCFK #multi #named #synthesis- MultiGain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives (TB, KC, VF, AK), pp. 181–187.
CAV-2015-BrenguierR #game studies #multi- Pareto Curves of Multidimensional Mean-Payoff Games (RB, JFR), pp. 251–267.
LICS-2015-ChatterjeeKK #markov #multi #process- Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes (KC, ZK, JK), pp. 244–256.
- LICS-2015-ClementeR #multi #problem #worst-case
- Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives (LC, JFR), pp. 257–268.
- FoSSaCS-2014-Chatterjee0GO #game studies #probability
- Perfect-Information Stochastic Mean-Payoff Parity Games (KC, LD, HG, YO), pp. 210–225.
ICALP-v1-2014-AllamigeonBG #algorithm #game studies #polynomial- The Tropical Shadow-Vertex Algorithm Solves Mean Payoff Games in Polynomial Time on Average (XA, PB, SG), pp. 89–100.
- ICALP-v2-2014-ChatterjeeI #complexity #game studies
- The Complexity of Ergodic Mean-payoff Games (KC, RIJ), pp. 122–133.
KDD-2014-FangT #linear- Networked bandits with disjoint linear payoffs (MF, DT), pp. 1106–1115.
- LICS-CSL-2014-RouxP #game studies #infinity
- Infinite sequential games with real-valued payoffs (SLR, AP), p. 10.
- LICS-CSL-2014-Velner #multi #robust #synthesis
- Finite-memory strategy synthesis for robust multidimensional mean-payoff objectives (YV), p. 10.
CASE-2013-VallamSNNN #locality #network- Topologies of stable strategic networks with localized payoffs (RDV, CAS, YN, RN, SN), pp. 844–849.
- TACAS-2013-BohyBFR #ltl #specification #synthesis
- Synthesis from LTL Specifications with Mean-Payoff Objectives (AB, VB, EF, JFR), pp. 169–184.
- ICALP-v1-2013-BorosEGM #algorithm #game studies #probability #pseudo #random
- A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions (EB, KME, VG, KM), pp. 220–231.
ICML-c3-2013-AgrawalG #linear- Thompson Sampling for Contextual Bandits with Linear Payoffs (SA, NG), pp. 127–135.
- ICALP-v2-2012-Velner #automaton #complexity
- The Complexity of Mean-Payoff Automaton Expression (YV), pp. 390–402.
- LICS-2012-ChatterjeeV #automaton #game studies
- Mean-Payoff Pushdown Games (KC, YV), pp. 195–204.
- ICALP-v1-2011-BorosEFGMM #analysis #approximate #game studies #probability
- Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes (EB, KME, MF, VG, KM, BM), pp. 147–158.
- LICS-2011-BrazdilBCFK #markov #multi #process
- Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes (TB, VB, KC, VF, AK), pp. 33–42.
- ICALP-v1-2010-AtseriasM #game studies #proving
- Mean-Payoff Games and Propositional Proofs (AA, ENM), pp. 102–113.
CSL-2010-DegorreDGRT #energy #game studies- Energy and Mean-Payoff Games with Imperfect Information (AD, LD, RG, JFR, ST), pp. 260–274.
- FoSSaCS-2009-AlurDMW #on the
- On ω-Languages Defined by Mean-Payoff Conditions (RA, AD, OM, GW), pp. 333–347.
- CSL-2008-Schewe #algorithm #game studies
- An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games (SS), pp. 369–384.
- ICALP-v2-2006-GimbertZ #game studies
- Deterministic Priority Mean-Payoff Games as Limits of Discounted Games (HG, WZ), pp. 312–323.
RE-2005-BerryDFGHW #question #requirements #why- To do or not to do: If the requirements engineering payoff is so good, why aren’t more companies doing it? (DMB, DD, AF, DCG, RH, AW), p. 447.
- LICS-2005-ChatterjeeHJ #game studies
- Mean-Payoff Parity Games (KC, TAH, MJ), pp. 178–187.
- KDD-1996-MasandP #comparison #modelling #predict
- A Comparison of Approaches for Maximizing Business Payoff of Prediction Models (BMM, GPS), pp. 195–201.
