Inbal Talgam-Cohen

According to our database1, Inbal Talgam-Cohen authored at least 31 papers between 2010 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Modularity and greed in double auctions.
Games and Economic Behavior, 2017

Why prices need algorithms (invited talk).
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Approximate modularity revisited.
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

Why Prices Need Algorithms.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Oblivious Rounding and the Integrality Gap.
Proceedings of the Approximation, 2016

2015
Crossing boundaries.
ACM Crossroads, 2015

Welfare and Revenue Guarantees for Competitive Bundling Equilibrium.
Proceedings of the Web and Internet Economics - 11th International Conference, 2015

Why Prices Need Algorithms.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

2014
Do no evil in research.
ACM Crossroads, 2014

Enriching your network via diversity.
ACM Crossroads, 2014

A shrimp's tale: why we need to fund research.
ACM Crossroads, 2014

Towards a critical debate about technology and its impact.
ACM Crossroads, 2014

Modularity and greed in double auctions.
Proceedings of the ACM Conference on Economics and Computation, 2014

Prediction and Welfare in Ad Auctions.
Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

2013
Money and power in academic publishing.
ACM Crossroads, 2013

Equip Yourself for Creativity.
ACM Crossroads, 2013

'Information wants to be free'.
ACM Crossroads, 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?.
ACM Crossroads, 2012

Announcing the XRDS blog.
ACM Crossroads, 2012

XRDS reloaded.
ACM Crossroads, 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

Ad auctions with data.
Proceedings of the 2012 Proceedings IEEE INFOCOM Workshops, 2012

2010
Human computation and crowdsourcing.
ACM Crossroads, 2010

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

Vertex Sparsifiers: New Results from Old Techniques.
Proceedings of the Approximation, 2010


  Loading...