# Inbal Talgam-Cohen

According to our database

Collaborative distances:

^{1}, Inbal Talgam-Cohen authored at least 41 papers between 2010 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

Approximate Modularity Revisited.

SIAM J. Comput., 2020

Escaping Cannibalization? Correlation-Robust Pricing for a Unit-Demand Buyer.

CoRR, 2020

The Complexity of Contracts.

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Multiagent Evaluation Mechanisms.

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Competitive Equilibrium with Generic Budgets: Beyond Additive.

CoRR, 2019

Settling the Communication Complexity of Combinatorial Auctions with Two Subadditive Buyers.

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Fair Allocation through Competitive Equilibrium from Generic Incomes.

Proceedings of the Conference on Fairness, Accountability, and Transparency, 2019

Simple versus Optimal Contracts.

Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018

Approximately Optimal Mechanism Design.

CoRR, 2018

Complement-Free Couples Must Communicate: A Hardness Result for Two-Player Combinatorial Auctions.

CoRR, 2018

2017

Modularity and greed in double auctions.

Games Econ. Behav., 2017

Competitive Equilibria with Indivisible Goods and Generic Budgets.

CoRR, 2017

Why prices need algorithms (invited talk).

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

The Competition Complexity of Auctions: A Bulow-Klemperer Result for Multi-Dimensional Bidders.

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

A Simple and Approximately Optimal Mechanism for a Buyer with Complements: Abstract.

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

When Are Welfare Guarantees Robust?.

Proceedings of the Approximation, 2017

2016

Optimal and Robust Mechanism Design with Interdependent Values.

ACM Trans. Economics and Comput., 2016

Prediction and Welfare in Ad Auctions.

Theory Comput. Syst., 2016

A Simple and Approximately Optimal Mechanism for a Buyer with Complements.

CoRR, 2016

Oblivious Rounding and the Integrality Gap.

Proceedings of the Approximation, 2016

2015

Why prices need algorithms.

SIGecom Exch., 2015

Crossing boundaries.

XRDS, 2015

Welfare and Revenue Guarantees for Competitive Bundling Equilibrium.

Proceedings of the Web and Internet Economics - 11th International Conference, 2015

2014

Vertex Sparsifiers: New Results from Old Techniques.

SIAM J. Comput., 2014

Do no evil in research.

XRDS, 2014

Enriching your network via diversity.

XRDS, 2014

A shrimp's tale: why we need to fund research.

XRDS, 2014

Towards a critical debate about technology and its impact.

XRDS, 2014

2013

Money and power in academic publishing.

XRDS, 2013

Equip Yourself for Creativity.

XRDS, 2013

'Information wants to be free'.

XRDS, 2013

Refine Predictions Ad Infinitum?

CoRR, 2013

Optimal and near-optimal mechanism design with interdependent values.

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

2012

Are you a good match for

*XRDS?*.
XRDS, 2012

Announcing the

*XRDS*blog.
XRDS, 2012

*XRDS*reloaded.

XRDS, 2012

Supply-limiting mechanisms.

Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Ad Auctions with Data.

Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012

2010

Human computation and crowdsourcing.

XRDS, 2010

A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium

CoRR, 2010

A Direct Reduction from

*k*-Player to 2-Player Approximate Nash Equilibrium.
Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010