LIPIcs, Volume 81, APPROX/RANDOM'17, Complete Volume

Συγγραφείς: Jansen, Klaus, Rolim, José D. P., Williamson, David, Vempala, Santosh S.

Συνεισφορές: Klaus Jansen and José D. P. Rolim and David Williamson and Santosh S. Vempala

Θεματικοί όροι: Network Architecture and Design, Coding and Information Theory, Error Control Codes, Modes of Computation: Online computation, Complexity Measures and Classes, Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems, Nonnumerical Algorithms and Problems

Περιγραφή αρχείου: application/pdf

Relation: Is Part Of LIPIcs, Volume 81, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)

Διαθεσιμότητα: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017
https://nbn-resolving.org/urn:nbn:de:0030-drops-77101
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2017

LIPIcs, Volume 60, APPROX/RANDOM'16, Complete Volume

Συγγραφείς: Jansen, Klaus, Mathieu, Claire, Rolim, José D. P., Umans, Chris

Συνεισφορές: Klaus Jansen and Claire Mathieu and José D. P. Rolim and Chris Umans

Θεματικοί όροι: Analysis of Algorithms and Problem Complexity, Models of Computation, Theory of Computation, ddc:004, Complexity Measures and Classes, Numerical Algorithms and Problems – Computations on Matrices, Nonnumerical Algorithms and Problems, Theory of Computation, Models of Computation, Modes of Computation – Online Computation, Complexity Measures and Classes, Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems – Computations on Matrices, Nonnumerical Algorithms and Problems, Modes of Computation – Online Computation

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016

Adaptive Contract Design for Crowdsourcing Markets: Bandit Algorithms for Repeated Principal-Agent Problems

Συγγραφείς: Chien-ju Hoy, Aleksandrs Slivkinsz, Jennifer Wortman Vaughanx

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.jennwv.com/papers/dynamicpa.pdf.

Θεματικοί όροι: ACM Categories and subject descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems, F.1.2 [Computation by Abstract Devices, Modes of Computation|Online computation, J.4 [Social and Behavioral Sciences, Economics Keywords, crowdsourcing, principal-agent, dynamic pricing, multi-armed bandits, regret

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.699.5081; http://www.jennwv.com/papers/dynamicpa.pdf

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.699.5081
http://www.jennwv.com/papers/dynamicpa.pdf

Contextual bandits with similarity information

Συγγραφείς: Aleksandrs Slivkins

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://arxiv.org/pdf/0907.3986v1.pdf.

Θεματικοί όροι: ACM Categories and subject descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems, F.1.2 [Computation by Abstract Devices, Modes of Computation—Online computation General Terms, Algorithms, Theory. Keywords, online learning, multi-armed bandits, contextual bandits, regret minimization, metric spaces

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.313.2364; http://arxiv.org/pdf/0907.3986v1.pdf

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.313.2364
http://arxiv.org/pdf/0907.3986v1.pdf

Characterizing truthful multi-armed bandit mechanisms

Συγγραφείς: Moshe Babaioff, Yogeshwer Sharma, Aleksandrs Slivkins

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://research.microsoft.com/pubs/77809/MAB-mech.pdf.

Θεματικοί όροι: ACM Categories and subject descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems, K.4.4 [Computers and Society, Electronic Commerce, F.1.2 [Computation by Abstract Devices, Modes of Computation—Online computation, J.4 [Social and Behavioral Sciences, Economics General Terms, theory, algorithms, economics. Keywords, mechanism design, truthful mechanisms, single-parameter auctions, multi-armed bandit problem, regret, online learning

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.422.9170

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.422.9170
http://research.microsoft.com/pubs/77809/MAB-mech.pdf

Similarity caching

Συγγραφείς: Flavio Chierichetti, Ravi Kumar, Sergei Vassilvitskii

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://theory.stanford.edu/~sergei/papers/pods09-simcaching.pdf.

Θεματικοί όροι: Categories and Subject Descriptors H.2.m [Database Management, Systems—Miscellaneous, F.1.2 [Computation by Abstract Devices, Modes of Computation—Online computation

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.360.7295

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.360.7295
http://theory.stanford.edu/~sergei/papers/pods09-simcaching.pdf

Competitive solutions for online financial problems

Συγγραφείς: Ran El-yaniv

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cs.jhu.edu/~scheideler/club/spring_02/p28-el-yaniv.pdf.

Θεματικοί όροι: Categories and Subject Descriptors, F.1.2 [Computation by Abstract Devices, Modes of Computation—online computation, probabilistic computation, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—sorting and searching, G.2.M [Discrete Mathematics, Miscellaneous, G.3 [Mathematics of Computation, Probability and Statistics, J.1 [Computer Applications, Administrative Data Processing—financial General Terms, Algorithms, Measurement, Performance, Theory

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.334.5413

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.334.5413
http://www.cs.jhu.edu/~scheideler/club/spring_02/p28-el-yaniv.pdf

Approximation in Stochastic Scheduling: The Power of LP-based Priority Policies

Συγγραφείς: Rolf H. Möhring, Andreas S. Schulz, Marc Uetz

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.math.tu-berlin.de/~uetz/jacm-subm.ps.Z.

Θεματικοί όροι: by Abstract Devices, Modes of Computation---Online computation General Terms, ALGORITHMS, THEORY Additional Key Words and Phrases, Stochastic scheduling, Approximation, Worst-case performance, Priority policy, LP-relaxation, WSEPT rule, Asymptotic optimality

Περιγραφή αρχείου: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.4164

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.4164
http://www.math.tu-berlin.de/~uetz/jacm-subm.ps.Z

Peking University and

Συγγραφείς: Wen Gao, Yonghong Tian, Tiejun Huang, Qiang Yang

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cse.ust.hk/~qyang/Docs/2011/a15-gao.pdf.

Θεματικοί όροι: Categories and Subject Descriptors, F.1.2 [Computation by Abstract Devices, Modes of Computation— Online computation, H.3.4 [Information Storage and Retrieval, Online Information Services—Webbased services, H.4[Information Systems Applications, Communications Applications—Computer conferencing, teleconferencing, and videoconferencing General Terms, Design, Human Factors, Management Additional Key Words and Phrases, Survey, vlogs, vlogging, multimedia computing, vlog mining ACM Reference Format

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.1214

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.1214
http://www.cse.ust.hk/~qyang/Docs/2011/a15-gao.pdf

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)

Συνεισφορές: Jansen, Klaus, Mathieu, Claire, Rolim, José D. P., Umans, Chris

Διαθεσιμότητα: http://data.europeana.eu/aggregation/europeana/2048441/item_NAMDODOHHLLYF5VQONYTE3SE3XB2J56U
http://data.europeana.eu/item/2048441/item_NAMDODOHHLLYF5VQONYTE3SE3XB2J56U

LIPIcs, Volume 60, APPROX/RANDOM'16, Complete Volume

Συγγραφείς: Klaus Jansen and Claire Mathieu and José D. P. Rolim and Chris Umans, Jansen, Klaus, Mathieu, Claire, Rolim, José D. P., Umans, Chris

Όροι ευρετηρίου: Theory of Computation, Models of Computation, Modes of Computation – Online Computation, Complexity Measures and Classes, Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems – Computations on Matrices, Nonnumerical Algorithms and Problems, Proceedings, Text, doc-type:ResearchArticle, publishedVersion

Σύνδεσμος: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016
Is Part Of LIPIcs, Volume 60, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)