Power surplus solutions for weighted hypergraph communication situations | 0 | 0.34 | 2022 |
Solving the shift and break design problem using integer linear programming | 0 | 0.34 | 2021 |
Greed Works-Online Algorithms For Unrelated Machine Stochastic Scheduling (Vol 46, Pg 835, 2021) | 0 | 0.34 | 2021 |
Greed Works - Online Algorithms For Unrelated Machine Stochastic Scheduling | 0 | 0.34 | 2020 |
The quality of equilibria for set packing and throughput scheduling games | 0 | 0.34 | 2020 |
The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing. | 0 | 0.34 | 2019 |
The price of anarchy for utilitarian scheduling games on related machines. | 0 | 0.34 | 2019 |
The sequential price of anarchy for affine congestion games with few players | 0 | 0.34 | 2019 |
Stochastic Online Scheduling On Unrelated Machines | 2 | 0.42 | 2017 |
The Quality of Equilibria for Set Packing Games. | 0 | 0.34 | 2017 |
The Asymptotic Price of Anarchy for k-uniform Congestion Games. | 0 | 0.34 | 2017 |
Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Types | 0 | 0.34 | 2016 |
Note on VCG vs. Price Raising for Matching Markets. | 1 | 0.40 | 2016 |
Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope. | 0 | 0.34 | 2016 |
Unrelated Machine Scheduling with Stochastic Processing Times. | 7 | 0.50 | 2016 |
Efficiency of Equilibria in Uniform Matroid Congestion Games. | 3 | 0.40 | 2016 |
On optimal mechanism design for a sequencing problem | 2 | 0.36 | 2015 |
The curse of sequentiality in routing games | 4 | 0.47 | 2015 |
The Sequential Price Of Anarchy For Atomic Congestion Games | 3 | 0.46 | 2014 |
Decomposition Algorithm for the Single Machine Scheduling Polytope. | 0 | 0.34 | 2014 |
Stochastic Scheduling on Unrelated Machines. | 2 | 0.41 | 2014 |
Two dimensional optimal mechanism design for a sequencing problem | 5 | 0.43 | 2013 |
Two-dimensional optimal mechanism design for a single machine scheduling problem. | 0 | 0.34 | 2013 |
Analysis of Smith's rule in stochastic machine scheduling | 0 | 0.34 | 2013 |
Decentralized Throughput Scheduling. | 2 | 0.42 | 2013 |
The price of anarchy for minsum related machine scheduling | 11 | 0.58 | 2011 |
On the complexity of a bundle pricing problem. | 0 | 0.34 | 2011 |
Lower bounds for smith's rule in stochastic machine scheduling | 1 | 0.40 | 2010 |
Optimal Mechanisms for Scheduling. | 0 | 0.34 | 2010 |
Mechanism Design for Decentralized Online Machine Scheduling | 4 | 0.43 | 2010 |
On the Complexity of the Highway Pricing Problem | 2 | 0.41 | 2010 |
Scheduling jobs with time-resource tradeoff via nonlinear programming | 7 | 0.63 | 2009 |
Optimal pricing of capacitated networks | 6 | 0.66 | 2009 |
Algorithms for Optimal Price Regulations | 0 | 0.34 | 2008 |
Optimal bundle pricing with monotonicity constraint | 5 | 0.48 | 2008 |
Optimal Mechanisms for Single Machine Scheduling | 4 | 0.40 | 2008 |
On Revenue Equivalence in Truthful Mechanisms. | 0 | 0.34 | 2007 |
Bundle pricing with comparable items | 8 | 0.59 | 2007 |
Optimal bundle pricing for homogeneous items | 0 | 0.34 | 2007 |
How to sell a graph: guidelines for graph retailers | 18 | 1.02 | 2006 |
Decentralization and Mechanism Design for Online Machine Scheduling | 20 | 1.29 | 2006 |
LP rounding and an almost harmonic algorithm for scheduling with resource dependent processing times | 3 | 0.43 | 2006 |
Models and Algorithms for Stochastic Online Scheduling | 42 | 1.74 | 2005 |
Stochastic Machine Scheduling with Precedence Constraints | 50 | 2.13 | 2005 |
On the generation of circuits and minimal forbidden sets | 10 | 0.69 | 2005 |
Scheduling parallel jobs with linear speedup | 5 | 0.50 | 2005 |
Fast ejection chain algorithms for vehicle routing with time windows | 1 | 0.35 | 2005 |
Unrelated parallel machine scheduling with resource dependent processing times | 9 | 1.31 | 2005 |
Stochastic online scheduling on parallel machines | 3 | 0.57 | 2004 |
Pricing network edges to cross a river | 10 | 1.01 | 2004 |