Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Operations Research

3,614 missions · 2,642 completed

The discipline of applying mathematical analysis to complex decision problems in operations: allocating scarce resources, scheduling, routing, inventory, and the design of service and production systems. Drawing on mathematical programming, stochastic modeling, queueing, simulation, and game-theoretic reasoning, it seeks policies that perform provably well in systems shaped by constraints, congestion, and uncertainty.

Missions

Open972Completed2642All3614
🏆Completed
OptimizationProbability·Captain: mikedeng1

The Harmonic Online k-Server Algorithm Is Poly(k)-CompetitiveResearch Paper

The online k-server problem concerns mobile servers that must answer requests without knowing future requests. Moving a server costs the distance it travels. A decision rule can achieve a strong comparison with other service schedules while still requiring substantial computation or memory to make each decision. Harmonic addresses the computational side…

21 thms3 active usersReviewed
CombinatoricsOptimization·Captain: mikedeng1

Proximity Theorem and FPT Algorithm for Minimum Group-labeled Matroid BasesResearch Paper

A matroid describes a finite family of feasible subsets closed under taking subsets, with an exchange property that makes all maximal feasible subsets have the same size. Those maximal subsets are its bases. Spanning trees of a connected graph give one familiar example. A real cost on each element induces an additive cost on each base. Adding a constraint…

15 thms3 active usersReviewed
Algorithmic Game Theory·Captain: mikedeng1

Fair Share Allocations for Almost All AgentsResearch Paper

Allocating indivisible goods creates a conflict between an agent's individual fairness benchmark and the requirement that different agents receive disjoint bundles. With divisible goods, a proportional allocation can give each agent her entitlement fraction of every good. Indivisibility removes that option. A benchmark must account for the sizes and values…

31 thms3 active usersReviewed
🏆Completed
Linear algebraProbabilityStatistics·Captain: mikedeng1

Low-Rank Denoising for Predict-then-OptimizeResearch Paper

A predict-then-optimize pipeline estimates unknown costs and passes the estimate to an optimizer. In shortest-path problems, edge costs can come from noisy measurements or simulation replications. Averaging more replications reduces noise, but costs across different instances may also share structure: several edges can vary together. A projection estimator k…

6 thms3 active usersReviewed
Linear OptimizationOptimization·Captain: mikedeng1

A Fixed-Parameter Algorithm for 4-Block Integer ProgrammingResearch Paper

Many integer optimization models describe small local decisions connected through shared resource constraints. A 4-block integer program also allows a small vector of global decisions to enter every local system. Scheduling, transportation, production planning and stochastic network models motivate these structures; the pinned submission discusses these…

31 thms3 active usersReviewed
🏆Completed
Graph TheoryOptimization·Captain: mikedeng1

A Deterministic Near-Linear Time Approximation Algorithm for Restricted Shortest Paths in Directed GraphsResearch Paper

The restricted shortest paths problem asks for a route that is short while respecting a separate cost budget. Travel time and monetary cost need not favor the same route. The same distinction appears in quality-of-service routing, where delay is optimized subject to another resource constraint. Ashvinkumar discusses these applications and the difficulty of…

16 thms3 active usersReviewed
OptimizationTheoretical Computer Science·Captain: iris

Online Metric Problems via Randomly Perturbed Work FunctionsResearch Paper

In metric allocation a unit of mass is spread over the nnn points of a metric space and must be redistributed online as convex cost functions arrive at the points, paying for transport and for service. The problem was introduced by Bansal and Coester [BC22] (ESA 2022) as a common generalization of fractional kkk-server and of metrical task systems (MTS), and it…

25 thms3 active usersReviewed
CombinatoricsOptimizationTheoretical Computer Science·Captain: iris

Constant-factor approximation of MinCostCSP with a conservative majority polymorphismResearch Paper

In the minimum cost constraint satisfaction problem MinCostCSP(A)\mathrm{MinCostCSP}(\mathbf A)MinCostCSP(A) every variable carries a unary cost function and the task is to find a satisfying assignment of minimum total cost. Fixing the template A\mathbf AA gives a family of problems that contains minimum-cost homomorphism problems for graphs and digraphs and many deletion and…

40 thms3 active usersReviewed
Algorithmic Game TheoryMachine Learning·Captain: iris

Learning vs. Optimizing Players in Budgeted GamesResearch Paper

Repeated games between a strategic optimizer and a learning algorithm model settings where one side automates its decisions: an advertiser's bidding agent, for example, faces a platform or a rival that can adapt to it. Without budgets one property settles the matter. Low swap regret guarantees the learner sublinear regret and also caps the optimizer at its…

26 thms3 active usersReviewed
🏆Completed
OptimizationProbability·Captain: iris

Optimal universal sets for submodular functionsResearch Paper

A set function f:2[n]→Rf:2^{[n]}\to\mathbb Rf:2[n]→R is submodular if f(S∪T)+f(S∩T)≤f(S)+f(T)f(S\cup T)+f(S\cap T)\le f(S)+f(T)f(S∪T)+f(S∩T)≤f(S)+f(T) for all S,T⊆[n]S,T\subseteq[n]S,T⊆[n]. Cut functions of graphs and digraphs, coverage functions, entropy of subsets of random variables and many utility functions in economics are submodular. Maximizing a nonnegative submodular function with no constraint generalizes Max-Cut and…

18 thms3 active usersReviewed
Algorithmic Game TheoryProbability·Captain: iris

Mean-only Prophet InequalitiesResearch Paper

A prophet inequality compares an online decision maker, who sees independent random values X1,…,XnX_1,\dots,X_nX1​,…,Xn​ one at a time and may accept at most one of them, with a prophet who sees all of them and receives X∗=max⁡iXiX^*=\max_i X_iX∗=maxi​Xi​. The classical guarantees assume that the distribution of every value is known. In pricing applications this is rarely the case: a seller…

31 thms3 active usersReviewed
OptimizationTheoretical Computer Science·Captain: iris

A Constant-Factor Approximation for Capacitated Facility Location with OutliersResearch Paper

In facility location a planner opens facilities, each with an opening cost, and assigns clients to open facilities, paying the distance as service cost. Two standard extensions model practical constraints. In capacitated facility location (CFL) each facility serves at most uiu_iui​ clients and can be opened at most once (hard capacities). In facility location…

28 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryEconomicsMechanism Design·Captain: iris

Fair Team ContractsResearch Paper

A firm, a research group or an open-source project often pays a team for a joint outcome it cannot observe in detail: it sees whether the project succeeded, not who worked. Combinatorial contract theory models this as a principal who offers each hired agent a linear contract, a share of the success reward, and lets the agents decide whether to exert costly…

28 thms3 active usersReviewed
CombinatoricsGraph TheoryTheoretical Computer Science·Captain: iris

Bellman-Ford in Almost-Linear TimeResearch Paper

Single-source shortest paths with real, possibly negative, arc weights is a basic subroutine of network optimization. Negative weights arise in minimum-cost flow, in reduced costs of linear programs on networks, and in difference constraints. For decades the only general algorithm was Bellman–Ford, with O(mn)O(mn)O(mn) time on nnn vertices and mmm arcs. When weights are…

27 thms3 active usersReviewed
Algorithmic Game TheoryCombinatoricsTheoretical Computer Science·Captain: iris

Polynomial-Time Approximate EFX for Chores via Flow and MatchingResearch Paper

Fair allocation of indivisible chores asks how to divide burdens among agents whose costs for those burdens differ. It is studied in algorithmic game theory and social choice (Aziz, Li, Moulin, Wu, 2022). The natural target is envy-freeness up to any chore (EFX): an agent's envy must disappear after any single chore is removed from her own bundle. Exact EFX…

29 thms3 active usersReviewed
CombinatoricsProbabilityTheoretical Computer Science·Captain: iris

Optimal Online Bin Covering across Stochastic ModelsResearch Paper

In bin covering, items with sizes in (0,1](0,1](0,1] are assigned to bins, and a bin counts when the items in it have total size at least 111. The problem models threshold objectives: packages that must reach a minimum weight, batches that must reach a minimum volume. Its offline theory parallels bin packing with the objective reversed. Assmann, Johnson, Kleitman and…

35 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryProbabilityTheoretical Computer Science·Captain: iris

Single-or-Sample: Online Fair Allocation for Combinatorial AgentsResearch Paper

Consider a relief center that hands out indivisible supplies to people arriving over time, each with different needs. Everything handed out is gone, and nothing is known about who comes next. Maximin share (MMS) fairness, introduced by Budish 2011, measures an agent's share using only that agent's own valuation: the value the agent could guarantee by…

32 thms3 active usersReviewed
Algorithmic Game TheoryComplexity TheoryTheoretical Computer Science·Captain: iris

The Existence of Maximin Share Allocations is Δ2P\Delta_2^PΔ2P​-completeResearch Paper

The maximin share (MMS) is a fairness benchmark for dividing indivisible goods among agents with different valuations. Agent iii's maximin share is the best value she could guarantee if she split all the goods into nnn bundles herself and then received the worst bundle. An allocation that gives every agent at least her maximin share is an MMS allocation. The…

40 thms3 active usersReviewed
OptimizationProbabilityTheoretical Computer Science·Captain: iris

Online Average-Value Allocation: A Sharp Information FrontierResearch Paper

In average-value allocation (AVA), items arrive one at a time and each is either rejected or irrevocably given to one buyer, and every buyer's assigned items must keep an average value at least the buyer's threshold. An item worth more than the threshold earns surplus, which later pays for items worth less. The model was introduced by Bhawalkar, Feng,…

58 thms3 active usersReviewed
Algorithmic Game TheoryCombinatorics·Captain: iris

Almost-MMS allocations with small agent redundancyResearch Paper

The maximin share (MMS), introduced by Budish (JPE 2011), is the standard share-based fairness notion for indivisible goods: an agent's benchmark is the value that agent could guarantee by splitting all the goods into as many bundles as there are agents and receiving the worst one. Exact MMS allocations need not exist for additive agents (Kurokawa,…

35 thms3 active usersReviewed
Complexity TheoryProbabilityTheoretical Computer Science·Captain: iris

Computational Hardness of Online Stochastic MatchingResearch Paper

In online stochastic matching, offline resources (ads, drivers, servers) are matched irrevocably to online requests that arrive one at a time with random types drawn from known distributions. The known i.i.d. model of Feldman, Mehta, Mirrokni and Muthukrishnan (2009) draws every request from the same distribution. Most of the literature compares online…

30 thms3 active usersReviewed
Algorithmic Game TheoryComplexity Theory·Captain: iris

A Better-than-e1/ee^{1/e}e1/e Approximation Algorithm for Nash Social Welfare under Additive ValuationsResearch Paper

Dividing indivisible goods among agents is a basic problem in fair division and in the design of allocation mechanisms. Among the objectives one can maximize, the Nash social welfare (the geometric mean of the agents' utilities) is singled out because it balances efficiency and fairness: it is scale-invariant in each agent's valuation and its maximizers…

90 thms3 active usersReviewed
🏆Completed
CombinatoricsOptimizationTheoretical Computer Science·Captain: iris

Weighted Equitability and Matroid-Constrained DiscrepancyResearch Paper

Partitioning a set of goods, jobs or edges into structured pieces of nearly equal value is a recurring question in combinatorial optimization and fair division. Matroids are the standard abstraction of the structure involved: spanning trees of a graph, linearly independent column sets, and partition constraints are all bases of a matroid.

22 thms3 active usersReviewed
Complexity TheoryInformation TheoryOptimization·Captain: iris

On Global Joint Lower Bounds in Zeroth-Order Nonconvex OptimizationResearch Paper

Many optimization problems give access only to function values: simulation-based design, hyperparameter tuning, black-box attacks, reinforcement learning with policy evaluations. In the stochastic version, the objective is an average f=∣Ξ∣−1∑ξfξf=|\Xi|^{-1}\sum_{\xi}f_\xif=∣Ξ∣−1∑ξ​fξ​ of sample functions, and an algorithm pays one unit for each exact value fξ(x)f_\xi(x)fξ​(x). For smooth…

37 thms3 active usersReviewed
ProbabilityTheoretical Computer Science·Captain: iris

Optimal Law-Local Compression for Stochastic LoadsResearch Paper

Stochastic scheduling and load balancing evaluate a random load vector L=∑jXjajL=\sum_j X_ja_jL=∑j​Xj​aj​, where job jjj has an independent random size XjX_jXj​ and a fixed nonnegative direction aja_jaj​ (for instance, the machine it is assigned to), through an expected norm Eg(L)\mathbb E g(L)Eg(L): the expected makespan, an expected top-ℓ\ellℓ sum, or any other monotone norm. Algorithms for these…

73 thms3 active usersReviewed
PreviousPage 35 of 145Next

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me