A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
The Target Discounted-Sum Problem

2015
*
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science
*

*The*

*target*

*discounted*-

*sum*

*problem*is

*the*following: Given a rational

*discount*factor 0 < λ < 1 and three rational values a, b, and t, does there exist a finite or an infinite sequence w ∈ {a, b} * or w ... We solve

*the*finite version of

*the*

*problem*, and show

*the*hardness of

*the*infinite version, linking it to various areas and open

*problems*in mathematics and computer science: βexpansions,

*discounted*-

*sum*... This research was supported in part by

*the*European Research Council (ERC) under grant 267989 (QUAREM) and by

*the*Austrian Science Fund (FWF) under grants S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award ...

##
###
Percentile Queries in Multi-dimensional Markov Decision Processes
[chapter]

2015
*
Lecture Notes in Computer Science
*

We consider classical quantitative payoffs from

doi:10.1007/978-3-319-21690-4_8
fatcat:7l43u4o4y5fm5eic7yczy3wtny
*the*literature (sup, inf, lim sup, lim inf, mean-payoff, truncated*sum*,*discounted**sum*). ... Our work extends to*the*quantitative case*the*multi-objective model checking*problem*studied by Etessami et al. [16] in unweighted MDPs. ...*The*precise*discounted**sum**problem*can be reduced to an almostsure percentile*problem*over a two-dimensional MDP with only one state. ...##
###
Percentile Queries in Multi-Dimensional Markov Decision Processes
[article]

2016
*
arXiv
*
pre-print

We consider classical quantitative payoffs from

arXiv:1410.4801v3
fatcat:pgwnk53kqzaxbapfhautnso7zm
*the*literature (sup, inf, lim sup, lim inf, mean-payoff, truncated*sum*,*discounted**sum*). ... Our work extends to*the*quantitative case*the*multi-objective model checking*problem*studied by Etessami et al. in unweighted MDPs. ... Assume we have a precise*discounted**sum**problem*with*discount*factor λ ∈ ]0, 1[ ∩ Q and*target*value t ∈ Q. ...##
###
The Cost of Exactness in Quantitative Reachability
[chapter]

2017
*
Lecture Notes in Computer Science
*

We compare

doi:10.1007/978-3-319-63121-9_18
fatcat:ax2g4suzkveepb3hgtigcj3pyq
*the*computational complexity of*the*value and exact value decision*problems*for classical quantitative objectives, such as*sum*,*discounted**sum*, energy, and mean-payoff for two standard models ...*The*value decision*problem*for a quantitative objective requires a trace whose value is at least a given threshold, and*the*exact value decision*problem*requires a trace whose value is exactly*the*threshold ... Conclusion In this work we studied*the*complexity of*the*value decision*problem*and*the*exact-value decision*problem*for*sum*,*discounted**sum*, and energy objectives for*the*indefinite-horizon case. ...##
###
An Evidential Reasoning Approach to Weighted Combination of Classifiers for Word Sense Disambiguation
[chapter]

2005
*
Lecture Notes in Computer Science
*

Essentially, this approach is based on

doi:10.1007/11510888_51
fatcat:m5wffewdhvcvrci44pcy2mtmia
*the*Dempster-Shafer theory of evidence. ... These proposed strategies are experimentally tested on*the*datasets for four polysemous words, namely interest, line, serve, and hard. ... Acknowledgement This research is partly conducted as a program for*the*of "Fostering Talent in Emergent Research Fields" in Special Coordination Funds for Promoting Science and Technology by*the*Japanese ...##
###
Repeated Games with Intervention: Theory and Applications in Communications

2012
*
IEEE Transactions on Communications
*

We study

doi:10.1109/tcomm.2012.071612.110626
fatcat:hzshbvunkzghdm5lnn5ckrapve
*the**problem*of maximizing a welfare function defined on users' payoffs. We characterize*the*limit set of equilibrium payoffs. ... Given*the*optimal equilibrium payoff, we derive*the*sufficient condition on*the**discount*factor and*the*intervention capability to achieve it, and design corresponding equilibrium strategies. ... This is also confirmed by Fig. 5 , which shows*the*minimum*discount*factor allowed to achieve*the**target*payoff that maximizes*the**sum*payoff, under different minimum payoffs γ and different maximum intervention ...##
###
On the Complexity of Shortest Path Problems on Discounted Cost Graphs
[chapter]

2013
*
Lecture Notes in Computer Science
*

*Discounted*Cost Register Automata (DCRA) associate costs with strings in a regular manner using

*the*operation of

*discounted*

*sum*. ...

*The*min-cost optimization

*problem*for DCRAs corresponds to computing shortest paths in graphs with more general forms of

*discounting*than

*the*well-studied notion of future

*discounting*. ... Therefore,

*the*algorithm suffices to solve

*the*prioritized shortest-path

*problem*in G 1 with source s and

*target*u 1 and bound K. ...

##
###
Goal-HSVI: Heuristic Search Value Iteration for Goal POMDPs

2018
*
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence
*

Besides

doi:10.24963/ijcai.2018/662
dblp:conf/ijcai/HorakBC18
fatcat:3tty2xlmsnaynhgpjifo5ptt7a
*the*well-known*discounted*-*sum*objective, indefinite-horizon objective (aka Goal-POMDPs) is another classical objective for POMDPs. ... In this case, given a set of*target*states and a positive cost for each transition,*the*optimization objective is to minimize*the*expected total cost until a*target*state is reached. ... In*discounted*-*sum**problems*,*the*sequence γ −t is strictly increasing and unbounded (since 0 < γ < 1). ...##
###
The Adversarial Stackelberg Value in Quantitative Games

2020
*
International Colloquium on Automata, Languages and Programming
*

For

doi:10.4230/lipics.icalp.2020.127
dblp:conf/icalp/FiliotGR20
fatcat:im4spvt3pfgyxjbe2g5cbiklzy
*the**discounted**sum*payoff function, we draw a link with*the**target**discounted**sum**problem*which explains why*the**problem*is difficult to solve for this payoff function. ... In this paper, we study*the*notion of adversarial Stackelberg value for two-player non-zero*sum*games played on bi-weighted graphs with*the*mean-payoff and*the**discounted**sum*functions. ...*The**target**discounted*-*sum**problem*reduces to*the**problem*of deciding if CSV(v) ≥ c in*discounted*-*sum*games. Proof. ...##
###
Non-stationary Resource Allocation Policies for Delay-constrained Video Streaming: Application to Video over Internet-of-Things-enabled Networks
[article]

2014
*
arXiv
*
pre-print

to use before their delay deadlines expire is a longstanding research

arXiv:1401.0855v1
fatcat:pyai7ixrrvbjbcas66xgui7rku
*problem*. ... We propose a novel solution that addresses this*problem*without assuming detailed packet-level knowledge, which is unavailable at resource allocation time. ... needs to determine*the**target*weighted*sum*rates r * ). ...##
###
Uniformization of frontiers in non-radial ZSG-DEA models: an application to airport revenues

2010
*
Pesquisa Operacional
*

*The*theoretical approach is applied to

*the*concession of

*discounts*and surcharges

*problem*, in terms of airport fees. ... We propose in this paper an extension to

*the*Zero

*Sum*Gains Data Envelopment Analysis model (ZSG-DEA). ... American and European airports, most of them privatised and with a more commercial philosophy, have noticed

*the*importance of

*the*ever increasing non-aeronautical revenues. ...

##
###
In reinforcement learning, all objective functions are not equal

2018
*
International Conference on Learning Representations
*

We observe in particular

dblp:conf/iclr/LarocheS18
fatcat:lb2depmppnexbesgheinmzw7jq
*the*influence of*the*γ parameter and*the*decomposition of*the*task into subtasks. ... We get*the*reward back propagation out of*the*way by fitting directly a deep neural network on*the*analytically computed optimal value function, given a chosen objective function. ... (x) = k i=1 γ d(x0,xi) , with*the*same notations as for TSP. •*The*vector DEC-obj*target*is*the*same as*the**summed*one, except that*the**target*is now a vector, separated into as many channels as potential ...##
###
Non-Stationary Resource Allocation Policies for Delay-Constrained Video Streaming: Application to Video over Internet-of-Things-Enabled Networks

2014
*
IEEE Journal on Selected Areas in Communications
*

to use before their delay deadlines expire is a longstanding research

doi:10.1109/jsac.2014.140410
fatcat:vxum6r66prcuhhron3ot27noyi
*problem*. ... We propose a novel solution that addresses this*problem*without assuming detailed packet-level knowledge, which is unavailable at resource allocation time (i.e. prior to*the*actual compression and transmission ... needs to determine*the**target*weighted*sum*rates r * ). ...##
###
DSDF: An approach to handle stochastic agents in collaborative multi-agent reinforcement learning
[article]

2021
*
arXiv
*
pre-print

Our solution, DSDF which tunes

arXiv:2109.06609v1
fatcat:nn5m4w4x3fdqhm3dz3mzj7qnny
*the**discounted*factor for*the*agents according to uncertainty and use*the*values to update*the*utility networks of individual agents. ... In this case,*the*deterministic agents have to understand*the*behavior and limitations of*the*stochastic agents while arriving at optimal joint policy. ... For both cases, we restrict*sum*of all food levels available in*the*grid to a number T such that total*sum*of*targets*for individual agents is equal to T in Case 1 and > T in Case 2. ...##
###
Evaluating the effectiveness of mergers and acquisitions for agribusiness companies

2020
*
E3S Web of Conferences
*

of

doi:10.1051/e3sconf/202020305016
fatcat:n3ftcpo5xvgang3fhqxpobrfua
*discounted*cash flow from acquisitions. ...*The*paper analyzes*the**problems*associated with*the*evaluation of these transactions and identifies ways to improve*the*evaluation methods. ... implemented if combined. ∑ ∑ ∑ ∑ ∑ ∑ ∑ ∑ ∑ ∑ ∑ ∑ (2) where -*the*increment of*the*capacity of*the*basic structure of*the*takeover of*the**target*company; ∑ ,∑ and ∑ -*the**sum*of*the*net present value of ...
« Previous

*Showing results 1 — 15 out of 109,295 results*