#### Filter Results:

- Full text PDF available (9)

#### Publication Year

2011

2016

- This year (0)
- Last 5 years (8)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

The fair division of indivisible goods has long been an important topic in economics and, more recently, computer science. We investigate the existence of envyfree allocations of indivisible goods, that is, allocations where each player values her own allocated set of goods at least as highly as any other player’s allocated set of goods. Under additive… (More)

- Jeremy Karp, R. Ravi
- APPROX-RANDOM
- 2014

We prove new results for approximating Graphic TSP. Specifically, we provide a polynomial-time 9 7 -approximation algorithm for cubic bipartite graphs and a ( 9 7 + 1 21(k−2) )-approximation algorithm for k-regular bipartite graphs, both of which are improved approximation factors compared to previous results. Our approach involves finding a cycle cover… (More)

We study the envy-free allocation of indivisible goods between two players. Our novel setting includes an option to sell each good for a fraction of the minimum value any player has for the good. To rigorously quantify the efficiency gain from selling, we reason about the price of envy-freeness of allocations of sellable goods — the ratio between the… (More)

We consider a service provider facing a continuum of delay-sensitive strategic customers. The service provider maximizes revenue by charging customers for the privilege of joining an M/G/1 queue and assigning them service priorities. Each customer has a valuation for the service, with a waiting cost per unit time that is proportional to their valuation;… (More)

- Jens Hilscher, Elif Şişli‐ciamarra, +16 authors Ly T. H. Tran
- 2011

Conflicts of interest on corporate boards: The effect of creditor‐directors on acquisitions Jens Hilscher Elif Şişli‐Ciamarra August 2011 Abstract This paper investigates the effects on acquisitions of creditor‐director presence on corporate boards. Using a hand‐collected dataset for boards of large U.S. corporations, we find that companies with… (More)

- Jeremy Karp, R. Ravi
- Discrete Applied Mathematics
- 2016

We prove new results for approximating Graphic TSP. Specifically, we provide a polynomialtime 9 7 -approximation algorithm for cubic bipartite graphs and a ( 9 7 + 1 21(k−2) )-approximation algorithm for k-regular bipartite graphs, both of which are improved approximation factors compared to previous results. Our approach involves finding a cycle cover with… (More)

- Sherwin Doroudi, Mustafa Akan, +4 authors Jennifer T. Chayes
- 2015

We consider a service provider facing a continuum of delay-sensitive strategic customers. The service provider maximizes revenue by charging customers for the privilege of joining an M/G/1 queue and assigning them service priorities. Each customer has a valuation for the service, with a waiting cost per unit time that is proportional to their valuation;… (More)

- Jeremy Karp
- 2013

This lecture is about hardness and computational problems that seem hard. Almost all of the theory of hardness is based on assumptions. We make assumptions about some problems, then we do reductions from one problem to another. Then, we want to make the minimal number of assumptions necessary to show computational hardness. In fact, all work on… (More)

- Jeremy Karp, R. Ravi
- 2013

We prove new results for approximating Graph-TSP. Speci cally, we provide a polynomial-time 9 7 approximation algorithm for cubic bipartite graphs and a ( 9 7 + 1 21(k−2) )-approximation algorithm for k-regular bipartite graphs, both of which are improved approximation factors compared to previous results. Our approach involves nding a cycle cover with… (More)

- ‹
- 1
- ›