No abstract available.
Proceeding Downloads
Cost per action constrained auctions
A standard result from auction theory is that bidding truthfully in a second price auction is a weakly dominant strategy. The result, however, does not apply in the presence of Cost Per Action (CPA) constraints. Such constraints exist, for instance, in ...
Computing optimal taxes in atomic congestion games
When the performance of a system is dictated by the behaviour of its users, self-interested choices can result in sub-optimal system operation, as is the case in road traffic networks. The inefficiency resulting from such selfish behaviour is commonly ...
Data markets with dynamic arrival of buyers and sellers
We propose a market design solution for a market for distributed data. The main challenges addressed by our solution are (1) different data providers produce different databases that can be joined to produce answers for users' queries; (2) data ...
Contract design for purchasing private data using a biased differentially private algorithm
Personal information and other types of private data are valuable for both data owners and institutions interested in providing targeted and customized services that require analyzing such data. In this context, privacy is sometimes seen as a commodity: ...
Incentivizing effort in interdependent security games using resource pooling
We consider an InterDependent Security (IDS) game with networked agents and positive externality where each agent chooses an effort/investment level for securing itself. The agents are interdependent in that the state of security of one agent depends ...
Managing adoption under network effects
The consumption of several modern products is marked by strong network effects, i.e., the utility to a consumer improves with the overall adoption in the market. Examples include mobile platforms that significantly rely on user-generated content, social ...
A characterization of cooperation in dynamic network games
This paper explores conditions under which players cooperate in a dynamic network game. Historically, folk theorems have provided a speckled perspective by showing that there exists equilibria where players cooperate, do not cooperate, as well as a ...
On the cluster admission problem for cloud computing
Cloud computing providers must handle heterogeneous customer workloads for resources such as (virtual) CPU or GPU cores. This is particularly challenging if customers, who are already running a job on a cluster, scale their resource usage up and down ...
Social learning with questions
In social networks, agents use information from (a) private signals (knowledge) they have, (b) learning past agents actions (observations), and (c) comments from contactable experienced agents (experts) to guide their own decisions. With fully ...
Max-min greedy matching
There has been much recent interest in the online bipartite matching problem of Karp, Vazirani and Vazirani [2], and variations of it, due to its applicability to allocation problems in certain economic settings. A prominent example is online ...
Recommendations
Acceptance Rates
Year | Submitted | Accepted | Rate |
---|---|---|---|
NetEcon '18 | 18 | 10 | 56% |
Overall | 18 | 10 | 56% |