Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Journal: Mathematics of Operations Research
Found
1103 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Risk Tuning with Generalized Linear Regression
2008,
Zabarankin Michael
A framework is set up in which linear regression, as a way of approximating a random...
The Flow Set with Partial Order
2008,
Atamtrk Alper
The flow set with partial order is a mixed–integer set described by a budget on...
Approximate Minimization of the Regularized Expected Error over Kernel Models
2008,
Krkov Vra
Learning from data under constraints on model complexity is studied in terms of rates...
What Matchings Can Be Stable? The Testable Implications of Matching Theory
2008,
Echenique Federico
This paper studies the falsifiability of two–sided matching theory when agents'...
Cost–Volume Relationship for Flows Through a Disordered Network
2008,
Aldous David J
In a network where the cost of flow across an edge is nonlinear in the volume of flow,...
Metastable Equilibria
2008,
Wilson Robert
Metastability is a refinement of the Nash equilibria of a game derived from two...
Label-Setting Methods for Multimode Stochastic Shortest Path Problems on Graphs
2008,
Vladimirsky Alexander
Stochastic shortest path (SSP) problems arise in a variety of discrete stochastic...
Parametric Integer Programming in Fixed Dimension
2008,
Eisenbrand Friedrich
Parametric integer programming deals with a family of integer programs that is defined...
On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games
2008,
Dunkel Juliane
Rosenthal's congestion games constitute one of the few known classes of noncooperative...
Better-Reply Dynamics with Bounded Recall
2008,
Zapechelnyuk Andriy
A decision maker is engaged in a repeated interaction with Nature. The objective of...
A Learning Algorithm for Risk-Sensitive Cost
2008,
Basu Arnab
A linear function approximation–based reinforcement learning algorithm is...
Efficient Routing in Heavy Traffic Under Partial Sampling of Service Times
2008,
Shwartz Adam
We consider a queue with renewal arrivals and n exponential servers in the...
A Unified Theorem on SDP Rank Reduction
2008,
Ye Yinyu
We consider the problem of finding a low–rank approximate solution to a system...
Finding the Exact Integrality Gap for Small Traveling Salesman Problems
2008,
Benoit Genevive
The symmetric traveling salesman problem (STSP) is to find a minimum weight...
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
2008,
Goemans Michel X
We consider a stochastic variant of the NP–hard 0/1 knapsack problem, in...
On the Solutions of Discrete Nonlinear Complementarity and Related Problems
2008,
Yang Zaifu
This paper concerns the existence of solutions to the discrete nonlinear...
On Zero Duality Gap and the Farkas Lemma for Conic Programming
2008,
Zlinescu Constantin
Recently S. A. Clark published an interesting duality result in linear conic...
Fluid Limits for Processor-Sharing Queues with Impatience
2008,
Robert Philippe
We investigate a processor–sharing queue with renewal arrivals and generally...
Extensive-Form Correlated Equilibrium: Definition and Computational Complexity
2008,
von Stengel Bernhard
This paper defines the extensive–form correlated equilibrium (EFCE) for...
Absorbing games with compact action spaces
2009,
Neyman Abraham
We prove that games with absorbing states with compact action sets have a value.
Time average replicator and best-reply dynamics
2009,
Hofbauer Josef
Using an explicit representation in terms of the logit map, we show, in a unilateral...
Online primal-dual algorithms for covering and packing
2009,
Naor Joseph (Seffi)
We study a wide range of online covering and packing optimization problems. In an...
Partially observed Markov decision process multiarmed bandits–structural results
2009,
Krishnamurthy Vikram
This paper considers multiarmed bandit problems involving partially observed Markov...
Penalty and smoothing methods for convex semi-infinite programming
2009,
Auslender Alfred
In this paper we consider min-max convex semi-infinite programming. To solve these...
First Page
8
9
10
11
12
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers