On the public citation graph

Competitive Algorithms from Competitive Equilibria

0 signed · 85 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jeth.1999.2531openalex-snapshot
Walrasian Equilibrium with Gross Substitutes
inferredcites →https://doi.org/10.1007/3-540-29578-x_11openalex-snapshot
Log-concave probability and its applications
inferredcites →https://doi.org/10.1007/3-540-63248-4_11openalex-snapshot
Random-based scheduling new approximations and LP lower bounds
inferredcites →https://doi.org/10.1007/978-3-540-79309-0_17openalex-snapshot
A Truthful Mechanism for Offline Ad Slot Scheduling
inferredcites →https://doi.org/10.1007/978-3-642-14165-2_28openalex-snapshot
Better Scalable Algorithms for Broadcast Scheduling
inferredcites →https://doi.org/10.1007/978-3-642-31594-7_41openalex-snapshot
Minimum Latency Submodular Cover
inferredcites →https://doi.org/10.1007/978-3-642-38016-7_15openalex-snapshot
Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling
inferredcites →https://doi.org/10.1007/978-3-662-48350-3_4openalex-snapshot
Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow Time Problems
inferredcites →https://doi.org/10.1007/bf01585506openalex-snapshot
Optimal flows in networks with multiple sources and sinks
inferredcites →https://doi.org/10.1007/s00199-004-0514-4openalex-snapshot
Log-concave probability and its applications
inferredcites →https://doi.org/10.1007/s00224-011-9349-0openalex-snapshot
Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor
inferredcites →https://doi.org/10.1007/s00453-019-00583-8openalex-snapshot
Primal–Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow-Time Problems
inferredcites →https://doi.org/10.1007/s10958-008-9144-xopenalex-snapshot
Approximation of convex sets by polytopes
inferredcites →https://doi.org/10.1007/s11134-006-7587-7openalex-snapshot
A queueing analysis of max-min fairness, proportional fairness and balanced fairness
inferredcites →https://doi.org/10.1007/s11134-009-9143-8openalex-snapshot
Resource pooling in congested networks: proportional fairness and product form
inferredcites →https://doi.org/10.1016/0047-2727(76)90018-9openalex-snapshot
Two problems in the theory of fairness
inferredcites →https://doi.org/10.1016/j.geb.2008.11.011openalex-snapshot
Eisenberg–Gale markets: Algorithms and game-theoretic properties
inferredcites →https://doi.org/10.1016/j.tcs.2018.02.021openalex-snapshot
Energy efficient scheduling of parallelizable jobs
inferredcites →https://doi.org/10.1016/s0196-6774(02)00251-1openalex-snapshot
A (2+ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective
inferredcites →https://doi.org/10.1017/cbo9780511804441openalex-snapshot
Convex Optimization
inferredcites →https://doi.org/10.1017/cbo9780511921735openalex-snapshot
The Design of Approximation Algorithms
inferredcites →https://doi.org/10.1023/a:1022952324290openalex-snapshot
Non-Clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics
inferredcites →https://doi.org/10.1038/sj.jors.2600523openalex-snapshot
Rate control for communication networks: shadow prices, proportional fairness and stability
inferredcites →https://doi.org/10.1057/palgrave.jors.2600523openalex-snapshot
Rate control for communication networks: shadow prices, proportional fairness and stability
inferredcites →https://doi.org/10.1109/5.16350openalex-snapshot
Broadcast delivery
inferredcites →https://doi.org/10.1109/90.811450openalex-snapshot
R×W: a scheduling approach for large-scale on-demand data broadcast
inferredcites →https://doi.org/10.1109/98.475988openalex-snapshot
Dissemination-based data delivery using broadcast disks
inferredcites →https://doi.org/10.1109/focs.2007.42openalex-snapshot
Pseudorandom Bits for Polynomials
inferredcites →https://doi.org/10.1109/focs.2014.63openalex-snapshot
SelfishMigrate: A Scalable Algorithm for Non-clairvoyantly Scheduling Heterogeneous Processors
inferredcites →https://doi.org/10.1109/focs.2015.38openalex-snapshot
Competitive Flow Time Algorithms for Polyhedral Scheduling
inferredcites →https://doi.org/10.1109/msst.2010.5496972openalex-snapshot
The Hadoop Distributed File System
inferredcites →https://doi.org/10.1137/060674417openalex-snapshot
Improved Approximation Algorithms for Broadcast Scheduling
inferredcites →https://doi.org/10.1145/1007352.1007411openalex-snapshot
Multi-processor scheduling to minimize flow time with ε resource augmentation
inferredcites →https://doi.org/10.1145/1147954.1147956openalex-snapshot
Dependent rounding and its applications to approximation algorithms
inferredcites →https://doi.org/10.1145/1536414.1536506openalex-snapshot
A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation
inferredcites →https://doi.org/10.1145/1998037.1998058openalex-snapshot
A tutorial on amortized local competitiveness in online scheduling
inferredcites →https://doi.org/10.1145/2150976.2150984openalex-snapshot
Tarazu
inferredcites →https://doi.org/10.1145/2189750.2150984openalex-snapshot
Tarazu
inferredcites →https://doi.org/10.1145/2229163.2229172openalex-snapshot
Scalably scheduling processes with arbitrary speedup curves
inferredcites →https://doi.org/10.1145/2342356.2342396openalex-snapshot
FairCloud
inferredcites →https://doi.org/10.1145/2344422.2344429openalex-snapshot
An online scalable algorithm for average flow time in broadcast scheduling
inferredcites →https://doi.org/10.1145/2482540.2482582openalex-snapshot
Mechanism design for fair division
inferredcites →https://doi.org/10.1145/2492002.2482582openalex-snapshot
Mechanism design for fair division
inferredcites →https://doi.org/10.1145/2541940.2541962openalex-snapshot
REF
inferredcites →https://doi.org/10.1145/2591796.2591814openalex-snapshot
Competitive algorithms from competitive equilibria
inferredcites →https://doi.org/10.1145/347476.347479openalex-snapshot
Speed is as powerful as clairvoyance
inferredcites →https://doi.org/10.1287/moor.22.3.513openalex-snapshot
Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
inferredcites →https://doi.org/10.1287/opre.1100.0888openalex-snapshot
An Ascending Vickrey Auction for Selling Bases of a Matroid
inferredcites →https://doi.org/10.2307/1907266openalex-snapshot
The Bargaining Problem
inferredcites →https://doi.org/10.5555/1855741.1855744openalex-snapshot
Improving MapReduce performance in heterogeneous environments
inferredcites →https://doi.org/10.5555/1972457.1972490openalex-snapshot
Dominant resource fairness: fair allocation of multiple resource types
inferredcites →https://doi.org/10.5555/2133036.2133045openalex-snapshot
Online scalable scheduling for the lk-norms of flow time without conservation of work
inferredcites →https://doi.org/10.5555/2170444.2170448openalex-snapshot
Heterogeneity-aware resource allocation and scheduling in the cloud
inferredcites →https://doi.org/10.5555/2627817.2627823openalex-snapshot
Online mixed packing and covering
inferredcites →https://doi.org/10.5555/2627817.2627827openalex-snapshot
Weighted flowtime on capacitated machines
inferredcites →https://doi.org/10.5555/2634074.2634079openalex-snapshot
Better algorithms and hardness for broadcast scheduling via a discrepancy approach
inferredcites →https://doi.org/10.5555/2634074.2634157openalex-snapshot
Primal dual gives almost optimal energy efficient online algorithms
inferredcites →https://doi.org/10.5555/2789945.2789946openalex-snapshot
Scheduling to Minimize Average Completion Time

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-12051-1_12-1openalex-snapshot
The Notion of Fair Division in Negotiations
inferred← citeshttps://doi.org/10.1007/978-3-031-32726-1_18openalex-snapshot
Competitive Kill-and-Restart and Preemptive Strategies for Non-clairvoyant Scheduling
inferred← citeshttps://doi.org/10.1007/s00453-023-01100-8openalex-snapshot
Resource-Constrained Scheduling Algorithms for Stochastic Independent Tasks With Unknown Probability Distribution
inferred← citeshttps://doi.org/10.1007/s10107-024-02118-8openalex-snapshot
Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling
inferred← citeshttps://doi.org/10.1007/s11107-018-0787-3openalex-snapshot
Priority-based grant-aware scheduling for low-latency switching
inferred← citeshttps://doi.org/10.1016/j.disopt.2022.100753openalex-snapshot
An improved greedy algorithm for stochastic online scheduling on unrelated machines
inferred← citeshttps://doi.org/10.1109/access.2023.3267538openalex-snapshot
Optimizing Resource Allocation Based on Predictive Process Monitoring
inferred← citeshttps://doi.org/10.1109/edm69524.2026.11632017openalex-snapshot
Uncertainty-Aware Predictive Resource Sharing in 5G Heterogeneous Networks: A Bayesian Neural Network and Minimum-Cost Flow Approach
inferred← citeshttps://doi.org/10.1109/jiot.2023.3339219openalex-snapshot
Randomized Cost Analysis for Nonclairvoyant Task Offloading in Edge Computing
inferred← citeshttps://doi.org/10.1109/rtcsa66114.2025.00031openalex-snapshot
The Cost of Accurate Predictions in Learning-Augmented Scheduling
inferred← citeshttps://doi.org/10.1109/tsg.2021.3138615openalex-snapshot
Smoothed Least-Laxity-First Algorithm for Electric Vehicle Charging: Online Decision and Performance Analysis With Resource Augmentation
inferred← citeshttps://doi.org/10.1137/1.9781611977073.13openalex-snapshot
Distortion-Oblivious Algorithms for Minimizing Flow Time
inferred← citeshttps://doi.org/10.1137/25m1763974openalex-snapshot
The Power of Proportional Fairness for Nonclairvoyant Polytope Scheduling
inferred← citeshttps://doi.org/10.1142/s0219265918500123openalex-snapshot
Online Job Dispatching and Scheduling to Minimize Job Completion Time and to Meet Deadlines
inferred← citeshttps://doi.org/10.1145/3288599.3288606openalex-snapshot
Distributed α-fair transmit power adaptation based congestion control in VANET
inferred← citeshttps://doi.org/10.1145/3319394openalex-snapshot
Ascending-Price Algorithms for Unknown Markets
inferred← citeshttps://doi.org/10.1145/3340234openalex-snapshot
Earning and Utility Limits in Fisher Markets
inferred← citeshttps://doi.org/10.1145/3406325.3451023openalex-snapshot
Flow time scheduling with uncertain processing time
inferred← citeshttps://doi.org/10.1145/3409964.3461790openalex-snapshot
Non-Clairvoyant Scheduling with Predictions
inferred← citeshttps://doi.org/10.1145/3434410openalex-snapshot
The Fair Division of Hereditary Set Systems
inferred← citeshttps://doi.org/10.1145/3490148.3538579openalex-snapshot
Permutation Predictions for Non-Clairvoyant Scheduling
inferred← citeshttps://doi.org/10.1145/3593969openalex-snapshot
Non-clairvoyant Scheduling with Predictions
inferred← citeshttps://doi.org/10.1145/3673038.3673149openalex-snapshot
Online Non-preemptive Multi-Resource Scheduling for Weighted Completion Time on Multiple Machines
inferred← citeshttps://doi.org/10.1145/3711872openalex-snapshot
Permutation Predictions for Non-Clairvoyant Scheduling
inferred← citeshttps://doi.org/10.1287/opre.2022.2321openalex-snapshot
An Optimal Control Framework for Online Job Scheduling with General Cost Functions
inferred← citeshttps://doi.org/10.3390/sym17070980openalex-snapshot
Optimal Energy-Aware Scheduling of Heterogeneous Jobs with Monotonically Increasing Slot Costs
inferred← citeshttps://doi.org/10.70675/46cf85e7z0090z4cc3za215z6576c75eed03openalex-snapshot
Scheduling independent tasks under budget and time constraints
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.