Shahar Ovadia

dblp:199/1977 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2Graphics, computer vision, multimedia, augmented reality and games · 1Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Algorithmic game theory and mechanism design · 96% Mathematical optimization · 4%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design › cooperative game theory
cost sharing
0.622018
Combinatorial Cost Sharing · IJCAI 2018
Combinatorial Cost Sharing · EC 2017
Algorithmic game theory and mechanism design
mechanism design
0.622018
Combinatorial Cost Sharing · IJCAI 2018
Combinatorial Cost Sharing · EC 2017
Algorithmic game theory and mechanism design › mechanism design
truthful mechanism
0.622018
Combinatorial Cost Sharing · IJCAI 2018
Combinatorial Cost Sharing · EC 2017
Algorithmic game theory and mechanism design › mechanism design
budget balance
0.312017
Combinatorial Cost Sharing · EC 2017
Algorithmic game theory and mechanism design
cooperative game theory
0.112018
Combinatorial Cost Sharing · IJCAI 2018
Mathematical optimization
potential function
0.112018
Combinatorial Cost Sharing · IJCAI 2018

Methods — techniques the papers use, named apart from their topics

potential function · 0.3VCG mechanism · 0.3
YearPublicationVenuePosition
2018 Combinatorial Cost Sharing
abstract
We introduce a combinatorial variant of the cost sharing problem: several services can be provided to each player and each player values every combination of services differently. A publicly known cost function specifies the cost of providing every possible combination of services. A combinatorial cost sharing mechanism is a protocol that decides which services each player gets and at what price. We look for dominant strategy mechanisms that are (economically) efficient and cover the cost, ideally without overcharging (i.e., budget balanced). Note that unlike the standard cost sharing setting, combinatorial cost sharing is a multi-parameter domain. This makes designing dominant strategy mechanisms with good guarantees a challenging task. We present the Potential Mechanism -- a combination of the VCG mechanism and a well-known tool from the theory of cooperative games: Hart and Mas-Colell's potential function. The potential mechanism is a dominant strategy mechanism that always covers the incurred cost. When the cost function is subadditive the same mechanism is also approximately efficient. Our main technical contribution shows that when the cost function is submodular the potential mechanism is approximately budget balanced in three settings: supermodular valuations, symmetric cost function and general symmetric valuations, and two players with general valuations.
Shahar Dobzinski, Shahar Ovadia
IJCAI2
2017 Combinatorial Cost Sharing
abstract
We introduce a combinatorial variant of the cost sharing problem: several services can be provided to each player and each player values every combination of services differently. A publicly known cost function specifies the cost of providing every possible combination of services. A combinatorial cost sharing mechanism is a protocol that decides which services each player gets and at what price. We look for dominant strategy mechanisms that are (economically) efficient and cover the cost, ideally without overcharging (i.e., budget balanced). Note that unlike the standard cost sharing setting, combinatorial cost sharing is a multi-parameter domain. This makes designing dominant strategy mechanisms with good guarantees a challenging task.
Shahar Dobzinski, Shahar Ovadia
EC2