Coordination mechanisms from (almost) all scheduling policies
DOI10.1145/2554797.2554811zbMATH Open1364.68103OpenAlexW2028342743MaRDI QIDQ2988872FDOQ2988872
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
Deterministic scheduling theory in operations research (90B35) Applications of game theory (91A80) Auctions, bargaining, bidding and selling, and other market models (91B26) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Cites Work
- Title not available (Why is that?)
- 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
- (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 (10)
- Title not available (Why is that?)
- Designing cost-sharing methods for Bayesian games
- An almost ideal coordination mechanism for unrelated machine scheduling
- The price of anarchy for utilitarian scheduling games on related machines
- Optimal Cost-Sharing in General Resource Selection Games
- Minimizing total completion time with machine-dependent priority lists
- Scheduling policies using marked/phantom slot algorithms
- Designing Networks with Good Equilibria under Uncertainty
- Coordination mechanisms for selfish scheduling
- Multi-round cooperative search games with multiple players
This page was built for publication: Coordination mechanisms from (almost) all scheduling policies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988872)
