Sequential decision making with vector outcomes

DOI10.1145/2554797.2554817zbMATH Open1366.91043OpenAlexW2056970718MaRDI QIDQ2988880FDOQ2988880

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

Recommendations

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

zbMATH Keywords

banditexpertvector outcome

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

• Possibilistic sequential decision making
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sequential Decision Making With Coherent Risk
• Sequential decision making without independence: a new conceptual approach
• Bandits with global convex constraints and objective
• Sequential decisions with several agents

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)