#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2015

2017

- This year (0)
- Last 5 years (11)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- George Christodoulou, AnnamÃ¡ria KovÃ¡cs, Alkmini Sgouritsa, Bo Tang
- ACM Trans. Economics and Comput.
- 2016

We study the price of anarchy (PoA) of simultaneous first-price auctions (FPAs) for buyers with submodular and subadditive valuations. The current best upper bounds for the Bayesian price of anarchyâ€¦ (More)

- George Christodoulou, Alkmini Sgouritsa
- SODA
- 2016

We consider the problem of designing network cost-sharing protocols with good equilibria under uncertainty. The underlying game is a multicast game in a rooted undirected graph with nonnegative edgeâ€¦ (More)

- George Christodoulou, Alkmini Sgouritsa, Bo Tang
- SAGT
- 2015

We study the efficiency of the proportional allocation mechanism, that is widely used to allocate divisible resources. Each agent submits a bid for each divisible resource and receives a fractionâ€¦ (More)

- George Christodoulou, Alkmini Sgouritsa, Bo Tang
- Algorithmica
- 2015

We study the inefficiency of mixed Nash equilibria, expressed as the price of anarchy, of all-pay auctions in three different environments: combinatorial, multi-unit and single-item auctions. First,â€¦ (More)

We study the performance of cost-sharing protocols in a selfish scheduling setting with load-dependent cost functions. Previous work on selfish scheduling protocols has focused on two extreme models:â€¦ (More)

- George Christodoulou, Stefano Leonardi, Alkmini Sgouritsa
- Theory of Computing Systems
- 2017

We study the design of cost-sharing protocols for two fundamental resource allocation problems, the Set Cover and the Steiner Tree Problem, under environments of incomplete information (Bayesianâ€¦ (More)

- George Christodoulou, Alkmini Sgouritsa
- ArXiv
- 2015

We propose a model to design network cost-sharing protocols with good equilibria under uncertainty. The underlying game is a multicast game in a rooted undirected graph with nonnegative edge costs. Aâ€¦ (More)

- George Christodoulou, Alkmini Sgouritsa, Bo Tang
- Theory of Computing Systems
- 2016

We study the efficiency of the proportional allocation mechanism that is widely used to allocate divisible resources. Each agent submits a bid for each divisible resource and receives a fractionâ€¦ (More)

- George Christodoulou, Alkmini Sgouritsa
- SODA
- 2017

We study the universal Traveling Salesman Problem in an n Ã— n grid with the shortest path metric. The goal is to define a (universal) total ordering over the set of gridâ€™s vertices, in a way that forâ€¦ (More)