Sequential decision making with vector outcomes

DOI10.1145/2554797.2554817MaRDI QIDQ2988880zbMATH OpenOpenAlexFDO

Authors Uriel Felge, Michal Feldman, Moshe Tennenholtz, Yossi Azar

Publication date 19 May 2017

Published in Proceedings of the 5th conference on Innovations in theoretical computer science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2554797.2554817

zbMATH Keywords

banditexpertvector outcome

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Decision theory (91B06) Multistage and repeated games (91A20)

Recommendations

• Combinatorial bandits
• Regret in online combinatorial optimization
• Better algorithms for benign bandits
• The Nonstochastic Multiarmed Bandit Problem
• Efficient algorithms for online decision problems.

Cites work

• scientific article; zbMATH DE number 1559544 (Why is no real title available?)
• (Leveled) fully homomorphic encryption without bootstrapping
• A hierarchy of polynomial time lattice basis reduction algorithms
• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• Bounds for Width Two Branching Programs
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Evaluating Branching Programs on Encrypted Data
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Fully homomorphic encryption using ideal lattices
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• New lattice-based cryptographic constructions
• On lattices, learning with errors, random linear codes, and cryptography
• On lattices, learning with errors, random linear codes, and cryptography
• Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
• Public-key cryptosystems from the worst-case shortest vector problem
• Toward basing fully homomorphic encryption on worst-case hardness
• Trapdoors for hard lattices and new cryptographic constructions
• Trapdoors for lattices: simpler, tighter, faster, smaller

Cited in

(8)

• Possibilistic sequential decision making
• scientific article; zbMATH DE number 5831358 (Why is no real title available?)
• scientific article; zbMATH DE number 5148988 (Why is no real title available?)
• scientific article; zbMATH DE number 7626715 (Why is no real title available?)
• Sequential decision making without independence: a new conceptual approach
• Sequential Decision Making With Coherent Risk
• Sequential decisions with several agents
• Bandits with global convex constraints and objective

This page was built for publication: Sequential decision making with vector outcomes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988880)