Coordination mechanisms from (almost) all scheduling policies

DOI10.1145/2554797.2554811zbMath1364.68103OpenAlexW2028342743MaRDI QIDQ2988872

Sayan Bhattacharya, Janardhan Kulkarni, Sungjin Im, Kamesh Munagala

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.2554811

Mathematics Subject Classification ID

Applications of game theory (91A80) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Auctions, bargaining, bidding and selling, and other market models (91B26) Distributed systems (68M14)

Related Items (8)

Multi-round cooperative search games with multiple players ⋮ The price of anarchy for utilitarian scheduling games on related machines ⋮ Optimal Cost-Sharing in General Resource Selection Games ⋮ Designing cost-sharing methods for Bayesian games ⋮ An almost ideal coordination mechanism for unrelated machine scheduling ⋮ Unnamed Item ⋮ Minimizing total completion time with machine-dependent priority lists ⋮ Designing Networks with Good Equilibria under Uncertainty

Cites Work

• Unnamed Item
• A hierarchy of polynomial time lattice basis reduction algorithms
• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• (Leveled) fully homomorphic encryption without bootstrapping
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Trapdoors for hard lattices and new cryptographic constructions
• Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
• Evaluating Branching Programs on Encrypted Data
• Bounds for Width Two Branching Programs
• Fully homomorphic encryption using ideal lattices
• Public-key cryptosystems from the worst-case shortest vector problem
• Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
• New lattice-based cryptographic constructions
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• On lattices, learning with errors, random linear codes, and cryptography
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Coordination mechanisms from (almost) all scheduling policies