José R. Correa

According to our database1, José R. Correa authored at least 76 papers between 2001 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
The Secretary Problem with Independent Sampling.
CoRR, 2020

Sample-driven optimal stopping: From the secretary problem to the i.i.d. prophet inequality.
CoRR, 2020

Streaming Algorithms for Online Selection Problems.
CoRR, 2020

The Two-Sided Game of Googol and Sample-Based Prophet Inequalities.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

The Value of Observability in Dynamic Pricing.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

2019
From pricing to prophets, and back!
Oper. Res. Lett., 2019

The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing.
Math. Oper. Res., 2019

Prophet Secretary Through Blind Strategies.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

School Choice in Chile.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

Prophet Inequalities for I.I.D. Random Variables from an Unknown Distribution.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

On the Price of Anarchy for flows over time.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018
Recent developments in prophet inequalities.
SIGecom Exch., 2018

Prophet Inequalities for Independent Random Variables from an Unknown Distribution.
CoRR, 2018

Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

2017
Optimal Continuous Pricing with Strategic Consumers.
Manag. Sci., 2017

Fare Evasion in Transit Networks.
Oper. Res., 2017

Network Congestion Games Are Robust to Variable Demand.
Proceedings of the Web and Internet Economics - 13th International Conference, 2017

Posted Price Mechanisms for a Random Stream of Customers.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Long Term Behavior of Dynamic Equilibria in Fluid Queuing Networks.
Proceedings of the Integer Programming and Combinatorial Optimization, 2017

Adaptivity in Network Interdiction.
Proceedings of the Decision and Game Theory for Security - 8th International Conference, 2017

2016
Splitting versus setup trade-offs for scheduling to minimize weighted completion time.
Oper. Res. Lett., 2016

Contingent Preannounced Pricing Policies with Strategic Consumers.
Oper. Res., 2016

Bounds on the welfare loss from moral hazard with limited liability.
Games Econ. Behav., 2016

Preface: LAGOS'13: Seventh Latin-American Algorithms, Graphs, and Optimization Symposium, Playa del Carmen, México - 2013.
Discret. Appl. Math., 2016

2015
TSP Tours in Cubic Graphs: Beyond 4/3.
SIAM J. Discret. Math., 2015

Strong LP formulations for scheduling splittable jobs on unrelated machines.
Math. Program., 2015

Dynamic Equilibria in Fluid Queueing Networks.
Oper. Res., 2015

Decentralized utilitarian mechanisms for scheduling games.
Games Econ. Behav., 2015

Clique partitioning with value-monotone submodular cost.
Discret. Optim., 2015

Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line: Algorithms and Complexity.
Discret. Comput. Geom., 2015

Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 15412).
Dagstuhl Reports, 2015

Adaptive Rumor Spreading.
Proceedings of the Web and Internet Economics - 11th International Conference, 2015

The Curse of Sequentiality in Routing Games.
Proceedings of the Web and Internet Economics - 11th International Conference, 2015

On Guillotine Cutting Sequences.
Proceedings of the Approximation, 2015

2014
Sensitivity analysis of markup equilibria in complementary markets.
Oper. Res. Lett., 2014

Pricing with markups in industries with increasing marginal costs.
Math. Program., 2014

Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Optimal Coordination Mechanisms for Multi-job Scheduling Games.
Proceedings of the Algorithms - ESA 2014, 2014

2013
The Price of Anarchy of the Proportional Allocation Mechanism Revisited.
Proceedings of the Web and Internet Economics - 9th International Conference, 2013

2012
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders.
Math. Oper. Res., 2012

2011
On the p-Median Polytope and the Intersection Property: Polyhedra and Algorithms.
SIAM J. Discret. Math., 2011

Inner product spaces for MinSum coordination mechanisms.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Existence and Uniqueness of Equilibria for Flows over Time.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010
Approximating a class of combinatorial problems with rational objective function.
Math. Program., 2010

Optimal Selection of Customers for a Last-Minute Offer.
Oper. Res., 2010

On the p-median polytope of fork-free graphs.
Electron. Notes Discret. Math., 2010

The Cost of Moral Hazard and Limited Liability in the Principal-Agent Problem.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Pricing with markups under horizontal and vertical competition.
Proceedings of the Behavioral and Quantitative Game Theory, 2010

2009
LP-based online scheduling: from single to parallel machines.
Math. Program., 2009

Monotone Covering Problems with an Additional Covering Constraint.
Math. Oper. Res., 2009

The Impact of Oligopolistic Competition in Networks.
Oper. Res., 2009

On the Planner's Loss Due to Lack of Information in Bayesian Mechanism Design.
Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
A fast asymptotic approximation scheme for bin packing with rejection.
Theor. Comput. Sci., 2008

Some remarks about factors of graphs.
J. Graph Theory, 2008

Bin packing with controllable item sizes.
Inf. Comput., 2008

A geometric approach to the price of anarchy in nonatomic congestion games.
Games Econ. Behav., 2008

Foreword.
Algorithmica, 2008

2007
Improved Bounds on Nonblocking 3-Stage Clos Networks.
SIAM J. Comput., 2007

Fast, Fair, and Efficient Flows in Networks.
Oper. Res., 2007

A note on the precedence-constrained class sequencing problem.
Discret. Appl. Math., 2007

A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs.
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

2006
Resource augmentation in two-dimensional packing with orthogonal rotations.
Oper. Res. Lett., 2006

Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes.
Math. Oper. Res., 2006

Approximating Rational Objectives Is as Easy as Approximating Linear Ones.
Proceedings of the Algorithm Theory, 2006

Network Games with Atomic Players.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
Single-Machine Scheduling with Precedence Constraints.
Math. Oper. Res., 2005

The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation.
Electron. Notes Discret. Math., 2005

On the Inefficiency of Equilibria in Congestion Games.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005

2004
Selfish Routing in Capacitated Networks.
Math. Oper. Res., 2004

Near-Optimal Solutions to Two-Dimensional Bin Packing With 90 Degree Rotations.
Electron. Notes Discret. Math., 2004

An approximate König's theorem for edge-coloring weighted bipartite graphs.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Approximation schemes for multidimensional packing.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem: Extended Abstract.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

Single Machine Scheduling with Precedence Constraints: Extended Abstract.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2001
Common-Lines and Passenger Assignment in Congested Transit Networks.
Transp. Sci., 2001


  Loading...