Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ilya Segal

dblp:04/2120 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
0since 2021 · last 2020
0000-0001-8605-3020ORCID · corroborated

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

Theory of computation · 5Artificial intelligence and machine learning · 3

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 · 100%
Computer networks
1 paper
Network optimization and economics · 100%

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

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design › auction theory › multi-item auctions
spectrum auction
0.522020
Incentive Auction Design Alternatives: A Simulation Study · EC 2020
Deferred-acceptance auctions and radio spectrum reallocation · EC 2014
Algorithmic game theory and mechanism design › auction theory › auction mechanism
reverse auction
0.412020
Incentive Auction Design Alternatives: A Simulation Study · EC 2020
Algorithmic game theory and mechanism design › mechanism design
auction design
0.212014
Deferred-acceptance auctions and radio spectrum reallocation · EC 2014
Algorithmic game theory and mechanism design › auction theory › auction mechanism
deferred-acceptance auction
0.212014
Deferred-acceptance auctions and radio spectrum reallocation · EC 2014
Network optimization and economics › resource allocation
spectrum allocation
0.112020
Incentive Auction Design Alternatives: A Simulation Study · EC 2020

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

simulation study · 0.9
YearPublicationVenuePosition
2020 Incentive Auction Design Alternatives: A Simulation Study
abstract
Over 13 months in 2016-17 the US Federal Communications Commission (FCC) conducted an "incentive auction" to repurpose radio spectrum from broadcast television to wireless internet. The result of the auction was to remove 14 UHF-TV channels from broadcast use, sell 70 MHz of wireless internet licenses for $19.8 billion, and create 14 MHz of spectrum for unlicensed uses. With fewer UHF channels remaining for TV broadcast, the TV spectrum was also reorganized. Each station was either "repacked" in the leftover channels or voluntarily sold its broadcast rights, either going off the air or switching to a different band. The volunteers received a total of $10.05 billion to yield or exchange their rights and make repacking possible.
Neil Newman, Kevin Leyton-Brown, Paul Milgrom, Ilya Segal
EC4
2014 Deferred-acceptance auctions and radio spectrum reallocation
abstract
No abstract available.
Paul Milgrom, Ilya Segal
EC2
2007 Auctions with Severely Bounded Communication
abstract
We study auctions with severe bounds on the communication allowed: each bidder may only transmit t bits of information to the auctioneer. We consider both welfare- and profit-maximizing auctions under this communication restriction. For both measures, we determine the optimal auction and show that the loss incurred relative to unconstrained auctions is mild. We prove non-surprising properties of these kinds of auctions, e.g., that in optimal mechanisms bidders simply report the interval in which their valuation lies in, as well as some surprising properties, e.g., that asymmetric auctions are better than symmetric ones and that multi-round auctions reduce the communication complexity only by a linear factor.
Liad Blumrosen, Noam Nisan, Ilya Segal
J. Artif. Intell. Res.3
2005 The communication cost of selfishness: ex post implementation
Ronald Fadel, Ilya Segal
TARK2
2005 Exponential communication inefficiency of demand queries
Noam Nisan, Ilya Segal
TARK2
2003 Multi-player and Multi-round Auctions with Severely Bounded Communication
Liad Blumrosen, Noam Nisan, Ilya Segal
ESA3